This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109512 Integers which are not the sum of n and A001462(n). 3

%I

%S 0,1,3,6,9,13,17,22,27,32,38,44,50,57,64,71,78,86,94,102,110,119,128,

%T 137,146,156,166,176,186,196,207,218,229,240,251,263,275,287,299,311,

%U 324,337,350,363,376,389,403,417,431,445,459,473,488,503,518,533,548

%N Integers which are not the sum of n and A001462(n).

%C Terms computed by _Robert G. Wilson v_.

%H Robert Price, <a href="/A109512/b109512.txt">Table of n, a(n) for n = 0..9999</a>

%e Let N=succession of the natural numbers, G=Golomb self-describing sequence, S=sum of n and according G(n):

%e N=1.2.3.4.5..6..7..8..9.10.11.12.13.14.15.16.17.18.19.20.21.22

%e G=1,2,2,3,3,.4,.4,.4,.5,.5,.5,.6,.6,.6,.6,.7,.7,.7,.7,.8,.8,.8

%e S=2.4.5.7.8.10.11.12.14.15.16.18.19.20.21.23.24.25.26.28.29.30

%e Integers not in S (0,1,3,6,9,13,17,22...) form the sequence.

%t a[1] = 1; a[n_] := a[n] = 1 + a[n - a[a[n - 1]]]; Do[ a[n], {n, 10^5}]; h = Complement[ Range[100000 + a[10^5]], Table[n + a[n], {n, 10000}]] t = Table[n + Sum[PrimePi[k], {k, 1, n}], {n, 0, 1200}]

%K base,easy,nonn

%O 0,3

%A _Eric Angelini_, _Alexandre Wajnberg_ and _Robert G. Wilson v_, Aug 29 2005

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

Last modified December 14 04:53 EST 2018. Contains 318090 sequences. (Running on oeis4.)