Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055563 a(n) = least number greater than a(n-1) not the sum of an earlier pair of consecutive terms, a(0) = 3. +0
3
3, 4, 5, 6, 8, 10, 12, 13, 15, 16, 17, 19, 20, 21, 23, 24, 26, 27, 29, 30, 32, 34, 35, 37, 38, 40, 42, 43, 45, 46, 48, 49, 51, 52, 54, 55, 57, 58, 60, 61, 63, 64, 65, 67, 68, 70, 71, 73, 74, 76, 77, 79, 80, 81, 83, 84, 86, 87, 89, 90, 92, 93, 95, 96, 98, 99, 101, 102, 104, 105 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = A022424(n)-a(n-1) for n>0

EXAMPLE

a(3) = 6 because a(2) = 5, 6<>a(0)+a(1) and 6<>a(1)+a(2); a(4) = 8 because a(3) = 6, 7 = a(0)+a(1), 8<>a(0)+a(1), 8<>a(1)+a(2) and 8<>a(2)+a(3)

CROSSREFS

Complement of A022424. See A001651 for a(0) = 1 and A055562 for a(0) = 2

Sequence in context: A092253 A073849 A136497 this_sequence A090161 A121540 A026512

Adjacent sequences: A055560 A055561 A055562 this_sequence A055564 A055565 A055566

KEYWORD

nonn

AUTHOR

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research