Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055562
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A055562
%S A055562 2,3,4,6,8,9,11,12,13,15,16,18,19,21,22,24,26,27,29,30,32,33,35,36,38,
%T A055562 39,41,42,44,45,47,48,49,51,52,54,55,57,58,60,61,63,64,66,67,69,70,72,
%U A055562 73,75,76,78,79,81,82,84,85,87,88,90,91,93,94,96,98,99,101,102,104,105
%N A055562 a(n) = least number greater than a(n-1) not the sum of an earlier pair 
               of consecutive terms, a(0) = 2.
%D A055562 J.-P. Allouche and J. Shallit, The ring of k-regular sequences, II, Theoret. 
               Computer Sci., 307 (2003), 3-29.
%H A055562 J.-P. Allouche and J. Shallit, <a href="http://www.lri.fr/~allouche/kreg2.ps">
               The Ring of k-regular Sequences, II</a>
%F A055562 a(n) = A022441(n)-a(n-1) for n>0
%F A055562 a(2n) = 3n+1 + (floor(log_2 n) mod 2), n >= 1; a(2n+1) = 3n+3, n >= 0 
               - Jeffrey Shallit, Jun 08, 2000.
%e A055562 a(2) = 4 because a(1) = 3 and 4<>a(0)+a(1), a(3) = 6 because a(2) = 4 
               and 5 = a(0)+a(1) but 6<>a(0)+a(1) and 6<>a(1)+a(2)
%Y A055562 Complement of A022441. See A001651 for a(0) = 1 and A055563 for a(0) 
               = 3
%Y A055562 Sequence in context: A135571 A138394 A140752 this_sequence A020900 A002479 
               A010458
%Y A055562 Adjacent sequences: A055559 A055560 A055561 this_sequence A055563 A055564 
               A055565
%K A055562 nonn
%O A055562 0,1
%A A055562 Henry Bottomley (se16(AT)btinternet.com), May 26 2000

    
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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research