[seqfan] Re: Digit-counters updating themselves
njasloane at gmail.com
Sat Oct 18 23:00:39 CEST 2014
A week ago Eric created a lovely new sequence which Maximilian entered as
A248034. It has a spectacular graph and it sounds pretty good too. I would
like to be able to see more terms and listen to the rest of the music, if
someone would create a b-file.
I gave it the keywords look and hear.
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 Sat, Oct 11, 2014 at 3:28 PM, M. F. Hasler <oeis at hasler.fr> wrote:
> my program seems to confirm your data (congrats !),
> I submitted a proposal as https://oeis.org/draft/A248034
> -- Maximilian
> On Sat, Oct 11, 2014 at 1:59 PM, Eric Angelini <Eric.Angelini at kntv.be>
> > Hello SeqFans,
> > pick any comma in D.
> > Immediately to the left of the comma
> > there is a digit 'd'.
> > Immediately to the right of the comma
> > there is an integer d(n).
> > D is such that there are d(n) digit 'd'
> > so far in D [from the start of D up to the comma].
> > In other words, the rightmost digit of d(n) is present d(n+1) times in
> D, counting from d(1) to d(n).
> > I'm wondering: do all integers appear
> > at least once in D?
> > P.-S.
> > It is possible to compute similar sequences
> > for every base. I guess the binary-one is:
> > B = 0,1,1,10,10,11,110,100,110,111,1110,...
> > Best,
> > É.
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan