cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A022952 a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=3 a(2)=6; where c( ) is complement of a( ).

This page as a plain text file.
%I A022952 #13 Apr 05 2016 10:46:46
%S A022952 3,6,10,15,22,30,39,50,62,75,89,105,122,140,159,179,200,223,247,272,
%T A022952 298,325,353,382,413,445,478,512,547,583,620,658,698,739,781,824,868,
%U A022952 913,959,1006,1054,1103,1154,1206,1259,1313,1368,1424,1481,1539
%N A022952 a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=3 a(2)=6; where c( ) is complement of a( ).
%C A022952 Here "complement" refers to the numbers not in the sequence.
%C A022952 Essentially the same as A022949. [_R. J. Mathar_, Oct 25 2008]
%H A022952 Ivan Neretin, <a href="/A022952/b022952.txt">Table of n, a(n) for n = 1..10000</a>
%t A022952 Fold[Append[#1, #1[[-1]] + Complement[Range[Max@#1 + 3], #1][[#2]]] &, {3, 6}, Range[3, 50]] (* _Ivan Neretin_, Apr 05 2016 *)
%Y A022952 Cf. A005228 and references therein.
%K A022952 nonn
%O A022952 1,1
%A A022952 _Clark Kimberling_