login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022948 Duplicate of A022443. 0

%I #15 Apr 09 2016 16:25:37

%S 1,4,9,15,22,30,40,51,63,76,90,106,123,141,160,180,201,224,248,273,

%T 299,326,354,383,414,446,479,513,548,584,621,659,698,739,781,824,868,

%U 913,959,1006,1054,1103,1153,1205,1258,1312,1367,1423,1480

%N Duplicate of A022443.

%C Previous name was: 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( ).

%F a(n) = A022443(n). - _R. J. Mathar_, May 28 2008

%K dead

%O 1,2

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 07:38 EDT 2024. Contains 374641 sequences. (Running on oeis4.)