login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022941 a(n) = a(n-1) + c(n-2) for n >= 3, a( ) increasing, given a(1)=1, a(2)=2; where c( ) is complement of a( ). 4
1, 2, 5, 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, 1538 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

MAPLE

a[1]:=1: a[2]:=2: c[1]:=3: for n from 2 to 70 do c[n]:=c[n-1]+1: for k from 1 to n do if(c[n]<=a[k])then if(c[n]=a[k])then c[n]:=c[n]+1: fi: break: fi: od: a[n+1]:=a[n]+c[n-1]: od: seq(a[n], n=1..70); # Nathaniel Johnston, May 01 2011

CROSSREFS

Cf. A143344 (first differences), A156031.

Sequence in context: A033096 A195014 A152738 * A007982 A011904 A047809

Adjacent sequences:  A022938 A022939 A022940 * A022942 A022943 A022944

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

a(27) inserted by Nathaniel Johnston (nathaniel(AT)nathanieljohnston.com), May 01 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:41 EST 2012. Contains 205570 sequences.