Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022936
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022936 a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=4; where c( ) is complement of a( ). +0
1
4, 5, 7, 10, 16, 24, 33, 44, 56, 69, 83, 98, 115, 133, 152, 172, 193, 215, 238, 263, 289, 316, 344, 373, 403, 434, 466, 500, 535, 571, 608, 646, 685, 725, 766, 808, 851, 896, 942, 989, 1037, 1086, 1136, 1187, 1239, 1292, 1346, 1401, 1458, 1516 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A013947 A093517 A018910 this_sequence A057496 A057708 A032686

Adjacent sequences: A022933 A022934 A022935 this_sequence A022937 A022938 A022939

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.521 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research