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
%I A085693
%S A085693 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,
%T A085693 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,
%U A085693 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
%N 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))), ...
%e A085693 0;
%e A085693 1;
%e A085693 1, 2;
%e A085693 1, 2, 2, 2, 3;
%e A085693 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4; ...
%e A085693 For large m, the m-th block is given by A085694.
%Y A085693 Cf. A085694, A000110, A048993 = the number of occurrences of k in n-th 
               block.
%Y A085693 Cf. A085694, A000110, A048993 (the number of occurrences of k in n-th 
               block).
%Y A085693 Sequence in context: A094876 A144159 A073610 this_sequence A067995 A135551 
               A065531
%Y A085693 Adjacent sequences: A085690 A085691 A085692 this_sequence A085694 A085695 
               A085696
%K A085693 nonn,easy
%O A085693 0,4
%A A085693 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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research