Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085693 Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, = f(4) = 44445, f(5) = 555556, etc. Sequence gives concatenation of 0, f(0), f(f(0)), f(f(f(0))), ... +0
4
0, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 5, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3 (list; graph; listen)
OFFSET

0,4

EXAMPLE

0;

1;

1, 2;

1, 2, 2, 2, 3;

1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4; ...

For large m, the m-th block is given by A085694.

CROSSREFS

Cf. A085694, A000110, A048993 = the number of occurrences of k in n-th block.

Cf. A085694, A000110, A048993 (the number of occurrences of k in n-th block).

Sequence in context: A094876 A144159 A073610 this_sequence A067995 A135551 A065531

Adjacent sequences: A085690 A085691 A085692 this_sequence A085694 A085695 A085696

KEYWORD

nonn,easy

AUTHOR

DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Aug 14, 2003; revised Sep 18 2005.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research