Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022948
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022948 a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=4; where c( ) is complement of a( ). +0
1
1, 2, 4, 9, 15, 22, 30, 40, 51, 63, 76, 90, 106, 123, 141, 160, 180, 201, 224, 248, 273, 299, 326, 354, 383, 414, 446, 479, 513, 548, 584, 621, 659, 698, 739, 781, 824, 868, 913, 959, 1006, 1054, 1103, 1153, 1205, 1258, 1312, 1367, 1423, 1480 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=A022443(n-1), n>2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 28 2008

CROSSREFS

Sequence in context: A042960 A045975 A058296 this_sequence A025217 A119759 A026036

Adjacent sequences: A022945 A022946 A022947 this_sequence A022949 A022950 A022951

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research