[seqfan] Re: Secondary offset of zero
Doug Bell
bell.doug at gmail.com
Tue Jun 23 12:41:21 CEST 2015
It should be easy to automate changing the secondary offset. If the
secondary offset is 1 and the first term is -1, 0 or 1, then set the
secondary offset to zero.
I assume you do some types of automated edits?
-Doug
On Jun 23, 2015 2:53 AM, <seqfan-request at list.seqfan.eu> wrote:
> Send SeqFan mailing list submissions to
> seqfan at list.seqfan.eu
>
> To subscribe or unsubscribe via the World Wide Web, visit
> http://list.seqfan.eu/cgi-bin/mailman/listinfo/seqfan
> or, via email, send a message with subject or body 'help' to
> seqfan-request at list.seqfan.eu
>
> You can reach the person managing the list at
> seqfan-owner at list.seqfan.eu
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of SeqFan digest..."
>
>
> Today's Topics:
>
> 1. Secondary offset of zero (Doug Bell)
> 2. Re: A computational challenge from 1973 (Neil Sloane)
> 3. Re: A problem with keyword "unkn" (Neil Sloane)
> 4. Re: A problem with keyword "unkn" (Neil Sloane)
> 5. Re: Secondary offset of zero (Neil Sloane)
> 6. How to calculate oblong root? (Alonso Del Arte)
> 7. Re: How to calculate oblong root? (David Applegate)
> 8. Re: How to calculate oblong root? (Frank Adams-Watters)
> 9. Re: How to calculate oblong root? (Neil Sloane)
> 10. A correction (Eric Angelini)
> 11. Re: How to calculate oblong root? (M. F. Hasler)
> 12. What is THE random permutation? (Neil Sloane)
> 13. Need more terms for the Linus and Sally sequences (Neil Sloane)
> 14. Re: Need more terms for the Linus and Sally sequences
> (hv at crypt.org)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Wed, 17 Jun 2015 07:39:41 -0700
> From: Doug Bell <bell.doug at gmail.com>
> To: seqfan at list.seqfan.eu
> Subject: [seqfan] Secondary offset of zero
> Message-ID:
> <CAOuq=n74=_EvtqNoVVvMNJPa7ic_9LO=
> ncwCkRoUqvUgrs68ZA at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> I asked this question on the wiki Offsets talk page
> <
> https://oeis.org/wiki/Talk:Offsets#Why_not_use_0_for_the_secondary_offset_when_all_terms_are_-1.2C_0.2C_or_1.3F
> >,
> but given that nobody apparently has that page watch-listed, perhaps this
> is a better place to get visibility.
>
> Why not use 0 for the secondary offset when all terms are -1, 0, or 1?
>
> Currently there is no way from the secondary offset to distinguish between
> sequences where the first term is not -1, 0, or 1 and sequences where *all*
> the terms *are* -1, 0, or 1.
>
> -Doug Bell
>
>
> ------------------------------
>
> Message: 2
> Date: Wed, 17 Jun 2015 10:52:37 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: A computational challenge from 1973
> Message-ID:
> <
> CAAOnSgS6zHUsLa1QtU5Y1ftn5iSBe5BnuiDMt_NYsMN0fTyq-Q at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Thanks Alex and Olivier! Just to get the ball rolling, I will create
> a new entry for the "squares" problem that Alex solved: it will be
> A258718 in a few hours. I will attach a scan of the original problem
> from Popular Computing.
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Wed, Jun 17, 2015 at 3:27 AM, Olivier Gerard
> <olivier.gerard at gmail.com> wrote:
> > On Wed, Jun 17, 2015 at 7:25 AM, Neil Sloane <njasloane at gmail.com>
> wrote:
> >
> >>
> >> Suppose m is a k-digit number. Let c(m) = m/100^k.
> >> Thus, if m is a 2-digit number, c(m) = .00m
> >> Example: m=16, c(m)=.0016 = 16/100^2.
> >> If m=127, c(m)=.000127 = 127/10^6.
> >>
> >> HERE IS THE PROBLEM:
> >> For a sequence a = a(1), a(2), a(3), ...,
> >> define f(a) = Sum_{n >= 1} c(a(n)).
> >>
> >> For example, take a = 1 4 9 16 25 36 ... the nonzero squares
> >> Then f(a) is the infinite sum of
> >> .01
> >> .04
> >> .09
> >> .0016
> >> .0025
> >> .0036
> >> ...
> >>
> >>
> > The principle is reminiscent of the Liouville numbers.
> > Most values of f for a(n) growing quickly enough will be transcendantal,
> I
> > presume.
> >
> >
> >> According to Popular Computing, my old friend Hermann P. Robinson
> >> computed that f(a) = .18190589020080121567...
> >>
> >> Problem 22 asks for more digits, and I'm asking for someone
> >> to enter this sequence (the sequence of decimal digits,
> >> with keyword cons, as usual).
> >
> >
> > and keyword base, of course.
> >
> >
> >
> >> If a = primes, f(a)=oo, so we don't consider that one!
> >>
> >>
> > But a variant with a function of the exponent growing quicker than 2
> would
> > converge.
> > One can write the c(m) function as
> >
> > m/10^(2*(1 + Floor[Log[10, m]]))
> >
> > so
> >
> > m/10^(3*(1 + Floor[Log[10, m]]))
> >
> > should work.
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Message: 3
> Date: Wed, 17 Jun 2015 19:50:48 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: A problem with keyword "unkn"
> Message-ID:
> <
> CAAOnSgTiULrApvi7CGmo1+kEP9PKQxSGTKOdOzaVPLRNY-MhKA at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> I agree too, and I'll change this tomorrow (unless someone else has done
> it)
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Wed, Jun 17, 2015 at 9:26 AM, Charles Greathouse
> <charles.greathouse at case.edu> wrote:
> > I agree with Giovanni.
> >
> > Charles Greathouse
> > Analyst/Programmer
> > Case Western Reserve University
> >
> > On Wed, Jun 17, 2015 at 7:33 AM, Giovanni Resta <g.resta at iit.cnr.it>
> wrote:
> >
> >> A recent submission ( https://oeis.org/draft/A259013 ) had Michel
> Marcus
> >> and me notice a little discrepancy between the
> >> clear-and-cut examples for "unkn" keyword:
> >>
> >> http://oeis.org/wiki/Clear-cut_examples_of_keywords
> >>
> >> and the tooltip the users see passing the mouse over "unkn",
> >> that is:
> >> "little is known; an unsolved problem. anyone who can find a formula or
> >> recurrence is encouraged to send it in."
> >>
> >> If I remember correctly, usually this keyword is used for sequences
> >> for which the definition itself is unknown (as said in the clear-and-cut
> >> example), not for those sequences (a multitude!) for which
> >> a closed formula is unknown.
> >>
> >> Maybe it would be better to change the tooltip, because it can
> >> confuse some new submitters.
> >>
> >> Giovanni
> >>
> >> _______________________________________________
> >>
> >> Seqfan Mailing list - http://list.seqfan.eu/
> >>
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Message: 4
> Date: Thu, 18 Jun 2015 09:26:24 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: A problem with keyword "unkn"
> Message-ID:
> <
> CAAOnSgRr+2ArrBZYR7DLdSCm94wLxJasp+V7pr5MZHnOcB+35w at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Well, I don't see how to change that "tooltip"! Charles, do you
> know how to do it? If so, can you tell
> me what you did?
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Wed, Jun 17, 2015 at 7:50 PM, Neil Sloane <njasloane at gmail.com> wrote:
> > I agree too, and I'll change this tomorrow (unless someone else has done
> it)
> > Best regards
> > Neil
> >
> > Neil J. A. Sloane, President, OEIS Foundation.
> > 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> > Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> > Phone: 732 828 6098; home page: http://NeilSloane.com
> > Email: njasloane at gmail.com
> >
> >
> >
> > On Wed, Jun 17, 2015 at 9:26 AM, Charles Greathouse
> > <charles.greathouse at case.edu> wrote:
> >> I agree with Giovanni.
> >>
> >> Charles Greathouse
> >> Analyst/Programmer
> >> Case Western Reserve University
> >>
> >> On Wed, Jun 17, 2015 at 7:33 AM, Giovanni Resta <g.resta at iit.cnr.it>
> wrote:
> >>
> >>> A recent submission ( https://oeis.org/draft/A259013 ) had Michel
> Marcus
> >>> and me notice a little discrepancy between the
> >>> clear-and-cut examples for "unkn" keyword:
> >>>
> >>> http://oeis.org/wiki/Clear-cut_examples_of_keywords
> >>>
> >>> and the tooltip the users see passing the mouse over "unkn",
> >>> that is:
> >>> "little is known; an unsolved problem. anyone who can find a formula
> or
> >>> recurrence is encouraged to send it in."
> >>>
> >>> If I remember correctly, usually this keyword is used for sequences
> >>> for which the definition itself is unknown (as said in the
> clear-and-cut
> >>> example), not for those sequences (a multitude!) for which
> >>> a closed formula is unknown.
> >>>
> >>> Maybe it would be better to change the tooltip, because it can
> >>> confuse some new submitters.
> >>>
> >>> Giovanni
> >>>
> >>> _______________________________________________
> >>>
> >>> Seqfan Mailing list - http://list.seqfan.eu/
> >>>
> >>
> >> _______________________________________________
> >>
> >> Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Message: 5
> Date: Thu, 18 Jun 2015 11:41:13 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: Secondary offset of zero
> Message-ID:
> <CAAOnSgT=
> P-UtGVQ0hLd8Hi4Eg5w-0VZjwrGE0hXGYpLsuMkG2A at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Doug, That is a good suggestion. If I was starting the database afresh,
> I would use that idea. But given that we have 258,000 entries, and
> many much more urgent
> things to deal with (especially the lack
> of editors and the
> ever-increasing size of the editing stack) it will have to wait
> until we have a few million dollars and a paid staff...
>
> I agree it is a good idea!
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Wed, Jun 17, 2015 at 10:39 AM, Doug Bell <bell.doug at gmail.com> wrote:
> > I asked this question on the wiki Offsets talk page
> > <
> https://oeis.org/wiki/Talk:Offsets#Why_not_use_0_for_the_secondary_offset_when_all_terms_are_-1.2C_0.2C_or_1.3F
> >,
> > but given that nobody apparently has that page watch-listed, perhaps this
> > is a better place to get visibility.
> >
> > Why not use 0 for the secondary offset when all terms are -1, 0, or 1?
> >
> > Currently there is no way from the secondary offset to distinguish
> between
> > sequences where the first term is not -1, 0, or 1 and sequences where
> *all*
> > the terms *are* -1, 0, or 1.
> >
> > -Doug Bell
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Message: 6
> Date: Sun, 21 Jun 2015 21:47:43 -0400
> From: Alonso Del Arte <alonso.delarte at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] How to calculate oblong root?
> Message-ID:
> <
> CAGyGvfWB9xZssfvkgVaMC1Evcvq0iHggJBchwXUPiWPK1XP2GA at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> The principal square root function is a function that is useful not only in
> mathematics but in many sciences. The principal oblong root function is
> significantly less useful, but once in a while it comes in handy, as in for
> example, the oblong number equivalent of A048761, the smallest square
> greater than or equal to n.
>
> If n is an integer of the form m * (m + 1) or m^2 + m with m also an
> integer, then oblongroot(n) = m. But if n is not of that form, then
> oblongroot(n) returns some number, possibly irrational, such that
> floor(oblongroot(n)) * ceiling(oblongroot(n)) is the smallest oblong number
> greater than n.
>
> Maybe the formula for oblongroot(n) is very easy, but at the moment, I
> don't see what it is.
>
> Al
>
> P.S. The secondary oblong root is a negative integer of the form -(m + 1),
> e.g., -5 is the secondary oblong root for 20.
>
> --
> Alonso del Arte
> Author at SmashWords.com
> <https://www.smashwords.com/profile/view/AlonsoDelarte>
> Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
>
>
> ------------------------------
>
> Message: 7
> Date: Sun, 21 Jun 2015 23:57:46 -0400
> From: David Applegate <david at research.att.com>
> To: seqfan at list.seqfan.eu
> Subject: [seqfan] Re: How to calculate oblong root?
> Message-ID: <201506220357.t5M3vkKh000441 at prim.research.att.com>
> Content-Type: text/plain; charset=us-ascii
>
> That definition of oblongroot(n) is ambiguous. If n is not an oblong
> number, then any x that satisfies
> floor(oblongroot(n)) < x < ceil(oblongroot(n))
> will also satisfy the definition of oblongroot(n).
>
> Why not just define oblongroot(n)=m, where m satisfies m^2 + m = n,
> that is, oblongroot(n) = sqrt(n+1/4)-1/2 (and the secondary oblong
> root is -sqrt(n+1/4)-1/2)?
>
> David Applegate AT&T Labs Research
> Tel: +1 908 901 2004 Email: david at research.att.com
> Recycle yourself -- be an organ donor
>
> > From seqfan-bounces at list.seqfan.eu Sun Jun 21 21:48:44 2015
> > Date: Sun, 21 Jun 2015 21:47:43 -0400
> > From: Alonso Del Arte <alonso.delarte at gmail.com>
> > To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> > Subject: [seqfan] How to calculate oblong root?
>
> > The principal square root function is a function that is useful not only
> in
> > mathematics but in many sciences. The principal oblong root function is
> > significantly less useful, but once in a while it comes in handy, as in
> for
> > example, the oblong number equivalent of A048761, the smallest square
> > greater than or equal to n.
>
> > If n is an integer of the form m * (m + 1) or m^2 + m with m also an
> > integer, then oblongroot(n) = m. But if n is not of that form, then
> > oblongroot(n) returns some number, possibly irrational, such that
> > floor(oblongroot(n)) * ceiling(oblongroot(n)) is the smallest oblong
> number
> > greater than n.
>
> > Maybe the formula for oblongroot(n) is very easy, but at the moment, I
> > don't see what it is.
>
> > Al
>
> > P.S. The secondary oblong root is a negative integer of the form -(m +
> 1),
> > e.g., -5 is the secondary oblong root for 20.
>
> > --
> > Alonso del Arte
> > Author at SmashWords.com
> > <https://www.smashwords.com/profile/view/AlonsoDelarte>
> > Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
>
> > _______________________________________________
>
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
>
> ------------------------------
>
> Message: 8
> Date: Mon, 22 Jun 2015 00:24:04 -0400
> From: Frank Adams-Watters <franktaw at netscape.net>
> To: seqfan at list.seqfan.eu
> Subject: [seqfan] Re: How to calculate oblong root?
> Message-ID: <14e198242e2-38c1-f310 at webprd-m47.mail.aol.com>
> Content-Type: text/plain; charset=utf-8
>
> Note that the ceiling of this function (sqrt(n+1/4)-1/2) is A000194. The
> floor is not in the database.
>
> Franklin T. Adams-Watters
>
> -----Original Message-----
> From: David Applegate <david at research.att.com>
> To: seqfan <seqfan at list.seqfan.eu>
> Sent: Sun, Jun 21, 2015 10:57 pm
> Subject: [seqfan] Re: How to calculate oblong root?
>
>
> That definition of oblongroot(n) is ambiguous. If n is not an oblong
> number,
> then any x that satisfies
> floor(oblongroot(n)) < x < ceil(oblongroot(n))
> will
> also satisfy the definition of oblongroot(n).
>
> Why not just define
> oblongroot(n)=m, where m satisfies m^2 + m = n,
> that is, oblongroot(n) =
> sqrt(n+1/4)-1/2 (and the secondary oblong
> root is -sqrt(n+1/4)-1/2)?
>
> David
> Applegate AT&T Labs Research
> Tel: +1 908 901 2004 Email:
> david at research.att.com
> Recycle yourself -- be an
> organ donor
>
> > From seqfan-bounces at list.seqfan.eu Sun Jun 21 21:48:44 2015
> >
> Date: Sun, 21 Jun 2015 21:47:43 -0400
> > From: Alonso Del Arte
> <alonso.delarte at gmail.com>
> > To: Sequence Fanatics Discussion list
> <seqfan at list.seqfan.eu>
> > Subject: [seqfan] How to calculate oblong root?
>
> > The
> principal square root function is a function that is useful not only in
> >
> mathematics but in many sciences. The principal oblong root function is
> >
> significantly less useful, but once in a while it comes in handy, as in for
> >
> example, the oblong number equivalent of A048761, the smallest square
> > greater
> than or equal to n.
>
> > If n is an integer of the form m * (m + 1) or m^2 + m
> with m also an
> > integer, then oblongroot(n) = m. But if n is not of that form,
> then
> > oblongroot(n) returns some number, possibly irrational, such that
> >
> floor(oblongroot(n)) * ceiling(oblongroot(n)) is the smallest oblong number
> >
> greater than n.
>
> > Maybe the formula for oblongroot(n) is very easy, but at the
> moment, I
> > don't see what it is.
>
> > Al
>
> > P.S. The secondary oblong root is a
> negative integer of the form -(m + 1),
> > e.g., -5 is the secondary oblong root
> for 20.
>
> > --
> > Alonso del Arte
> > Author at SmashWords.com
> >
> <https://www.smashwords.com/profile/view/AlonsoDelarte>
> > Musician at
> ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
>
> >
> _______________________________________________
>
> > Seqfan Mailing list -
> http://list.seqfan.eu/
>
>
> _______________________________________________
>
> Seqfan
> Mailing list - http://list.seqfan.eu/
>
>
>
>
> ------------------------------
>
> Message: 9
> Date: Mon, 22 Jun 2015 01:28:18 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: How to calculate oblong root?
> Message-ID:
> <
> CAAOnSgQsL73v+mAxEELJ4KLXokDV5qwkAmAPvij3_HfYACw02A at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> > The floor is not in the database.
> Please add it!
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Mon, Jun 22, 2015 at 12:24 AM, Frank Adams-Watters
> <franktaw at netscape.net> wrote:
> > Note that the ceiling of this function (sqrt(n+1/4)-1/2) is A000194. The
> floor is not in the database.
> >
> > Franklin T. Adams-Watters
> >
> > -----Original Message-----
> > From: David Applegate <david at research.att.com>
> > To: seqfan <seqfan at list.seqfan.eu>
> > Sent: Sun, Jun 21, 2015 10:57 pm
> > Subject: [seqfan] Re: How to calculate oblong root?
> >
> >
> > That definition of oblongroot(n) is ambiguous. If n is not an oblong
> > number,
> > then any x that satisfies
> > floor(oblongroot(n)) < x < ceil(oblongroot(n))
> > will
> > also satisfy the definition of oblongroot(n).
> >
> > Why not just define
> > oblongroot(n)=m, where m satisfies m^2 + m = n,
> > that is, oblongroot(n) =
> > sqrt(n+1/4)-1/2 (and the secondary oblong
> > root is -sqrt(n+1/4)-1/2)?
> >
> > David
> > Applegate AT&T Labs Research
> > Tel: +1 908 901 2004 Email:
> > david at research.att.com
> > Recycle yourself -- be an
> > organ donor
> >
> >> From seqfan-bounces at list.seqfan.eu Sun Jun 21 21:48:44 2015
> >>
> > Date: Sun, 21 Jun 2015 21:47:43 -0400
> >> From: Alonso Del Arte
> > <alonso.delarte at gmail.com>
> >> To: Sequence Fanatics Discussion list
> > <seqfan at list.seqfan.eu>
> >> Subject: [seqfan] How to calculate oblong root?
> >
> >> The
> > principal square root function is a function that is useful not only in
> >>
> > mathematics but in many sciences. The principal oblong root function is
> >>
> > significantly less useful, but once in a while it comes in handy, as in
> for
> >>
> > example, the oblong number equivalent of A048761, the smallest square
> >> greater
> > than or equal to n.
> >
> >> If n is an integer of the form m * (m + 1) or m^2 + m
> > with m also an
> >> integer, then oblongroot(n) = m. But if n is not of that form,
> > then
> >> oblongroot(n) returns some number, possibly irrational, such that
> >>
> > floor(oblongroot(n)) * ceiling(oblongroot(n)) is the smallest oblong
> number
> >>
> > greater than n.
> >
> >> Maybe the formula for oblongroot(n) is very easy, but at the
> > moment, I
> >> don't see what it is.
> >
> >> Al
> >
> >> P.S. The secondary oblong root is a
> > negative integer of the form -(m + 1),
> >> e.g., -5 is the secondary oblong root
> > for 20.
> >
> >> --
> >> Alonso del Arte
> >> Author at SmashWords.com
> >>
> > <https://www.smashwords.com/profile/view/AlonsoDelarte>
> >> Musician at
> > ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
> >
> >>
> > _______________________________________________
> >
> >> Seqfan Mailing list -
> > http://list.seqfan.eu/
> >
> >
> > _______________________________________________
> >
> > Seqfan
> > Mailing list - http://list.seqfan.eu/
> >
> >
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Message: 10
> Date: Mon, 22 Jun 2015 13:35:38 +0200
> From: Eric Angelini <Eric.Angelini at kntv.be>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] A correction
> Message-ID:
> <8B00BFBA136BAB43AD27F9EDC3758F03BD2BC0C1D4 at KNTVSRV01.kntv.local>
> Content-Type: text/plain; charset="iso-8859-1"
>
>
> Hello Seqfans,
> this is not correct in the comment of https://oeis.org/A238980, I guess:
>
> > A self-describing sequence which is a permutation of the natural numbers.
>
> No, as "1" is already in the sequence, the integer 101 will never show,
> for instance (as we would need another "1" to describe the size of this
> not underlined block).
> I will try to erase this stupid comment of mine myself now.
> Best,
> É.
>
>
>
> ------------------------------
>
> Message: 11
> Date: Mon, 22 Jun 2015 09:10:33 -0400
> From: "M. F. Hasler" <oeis at hasler.fr>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: How to calculate oblong root?
> Message-ID:
> <CAOPi3Q+RUkn7nRdun0-8miNikJt_cfhQXPwDm=HsKPHHFe4=
> pQ at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Alonso,
> do you have a reference for this precise* definition of "oblong root" ?
> (* it is not that precise, due to the fact that you define it only via its
> floor and ceiling. You can add any random function with values between 0
> and 1 to its floor and still have the same property. In particular you can
> take the integer valued function you will find as inverse of the triangular
> numbers (argument x 2) and add some small constant, e.g. 0.5)
>
> It would seem more natural to me to define it as the inverse function of x
> -> x (x+1) on the half line on which it is increasing.
>
> I think in sequences related to triangular numbers and indexing functions
> to triangular tables (the one that gives the row of the n-th element of a
> triangle) you should find what you are looking for (up to the factor 2).
>
> Maximilian
> Le 21 juin 2015 21:48, "Alonso Del Arte" <alonso.delarte at gmail.com> a
> écrit :
>
> > The principal square root function is a function that is useful not only
> in
> > mathematics but in many sciences. The principal oblong root function is
> > significantly less useful, but once in a while it comes in handy, as in
> for
> > example, the oblong number equivalent of A048761, the smallest square
> > greater than or equal to n.
> >
> > If n is an integer of the form m * (m + 1) or m^2 + m with m also an
> > integer, then oblongroot(n) = m. But if n is not of that form, then
> > oblongroot(n) returns some number, possibly irrational, such that
> > floor(oblongroot(n)) * ceiling(oblongroot(n)) is the smallest oblong
> number
> > greater than n.
> >
> > Maybe the formula for oblongroot(n) is very easy, but at the moment, I
> > don't see what it is.
> >
> > Al
> >
> > P.S. The secondary oblong root is a negative integer of the form -(m +
> 1),
> > e.g., -5 is the secondary oblong root for 20.
> >
> > --
> > Alonso del Arte
> > Author at SmashWords.com
> > <https://www.smashwords.com/profile/view/AlonsoDelarte>
> > Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
>
> ------------------------------
>
> Message: 12
> Date: Mon, 22 Jun 2015 12:03:23 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] What is THE random permutation?
> Message-ID:
> <CAAOnSgR3V6XaCx0du63bNV07a9T4ECBFMyRTKT=
> eg-OKd60_hg at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Dear Seq fans, there is a paper in the latest issue of
> the Electronic J Combin, by Linman and Pinsker,
> Permutations on the random permutation,
> see http://www.combinatorics.org/ojs/index.php/eljc/issue/current
>
> They talk about THE random permutation as a unique well-defined thing.
> It is the Fraissee limit of something ...
>
> My question is, if this really is unique and well-defined, what is it
> and shouldn't it be in the OEIS?
>
> Maybe someone who is better educated in logic that I am can look into this?
>
>
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
> ------------------------------
>
> Message: 13
> Date: Mon, 22 Jun 2015 17:31:36 -0400
> From: Neil Sloane <njasloane at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Need more terms for the Linus and Sally sequences
> Message-ID:
> <CAAOnSgSJ-e2C2xASZA-TksTnebL0HZv4WFzy_J47-=
> Lr2sJWVQ at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
>
> Dear Seq Fans,
> Going through my old correspondence files
> (Kellen Myers is helping me scan in some of the crucial unpublished
> historical material, which we are adding to the appropriate
> entries), I came across the original letters from Nathaniel Hellerstein
> concerning A006345 and A006346 (scans of some
> of this will be added to the OEIS soon)
>
> In one letter from 1978 he sent me 20000 terms of those two sequences
> on computer printouts. The present b-files
> only give 1000 terms. It would be nice to show that we can
> do better. Could someone produce 20000-terms b-files, or even
> 50000-term b-files?
>
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
> ------------------------------
>
> Message: 14
> Date: Tue, 23 Jun 2015 10:33:24 +0100
> From: hv at crypt.org
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: Need more terms for the Linus and Sally
> sequences
> Message-ID: <201506230933.t5N9XOP29416 at crypt.org>
>
> I have these calculated, just checking the results and I'll upload them.
>
> Hugo
>
> Neil Sloane <njasloane at gmail.com> wrote:
> :Dear Seq Fans,
> :Going through my old correspondence files
> :(Kellen Myers is helping me scan in some of the crucial unpublished
> :historical material, which we are adding to the appropriate
> :entries), I came across the original letters from Nathaniel Hellerstein
> :concerning A006345 and A006346 (scans of some
> :of this will be added to the OEIS soon)
> :
> :In one letter from 1978 he sent me 20000 terms of those two sequences
> :on computer printouts. The present b-files
> :only give 1000 terms. It would be nice to show that we can
> :do better. Could someone produce 20000-terms b-files, or even
> :50000-term b-files?
> :
> :Best regards
> :Neil
> :
> :Neil J. A. Sloane, President, OEIS Foundation.
> :11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> :Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> :Phone: 732 828 6098; home page: http://NeilSloane.com
> :Email: njasloane at gmail.com
> :
> :_______________________________________________
> :
> :Seqfan Mailing list - http://list.seqfan.eu/
>
>
> ------------------------------
>
> Subject: Digest Footer
>
> _______________________________________________
> SeqFan mailing list
> SeqFan at list.seqfan.eu
> http://list.seqfan.eu/cgi-bin/mailman/listinfo/seqfan
>
> ------------------------------
>
> End of SeqFan Digest, Vol 81, Issue 5
> *************************************
>
More information about the SeqFan
mailing list