Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022943
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022943 a(n) = a(n-2) + c(n-1) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3, where c( ) is complement of a( ). +0
1
2, 3, 6, 8, 13, 17, 23, 28, 35, 42, 50, 58, 68, 77, 88, 98, 110, 122, 135, 148, 162, 177, 192, 208, 224, 241, 258, 277, 295, 315, 334, 355, 375, 398, 419, 443, 465, 490, 513, 539, 564, 591, 617, 645, 672, 701, 729, 760, 789, 821, 851, 884, 915 (list; graph; listen)
page 1

Search completed in 0.001 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