Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022938
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022938 a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=6; where c( ) is complement of a( ). +0
1
6, 7, 9, 12, 16, 21, 29, 39, 50, 63, 77, 92, 109, 127, 146, 166, 188, 211, 235, 260, 286, 313, 341, 371, 402, 434, 467, 501, 536, 572, 609, 647, 687, 728, 770, 813, 857, 902, 948, 995, 1043, 1092, 1143, 1195, 1248, 1302, 1357, 1413, 1470, 1528 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A094698 A096405 A108595 this_sequence A048585 A049304 A045014

Adjacent sequences: A022935 A022936 A022937 this_sequence A022939 A022940 A022941

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research