The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121878 a(1)=1. a(n) = the smallest positive integer not occurring earlier in the sequence such that a(n-1)+a(n) is squarefree. 11
 1, 2, 3, 4, 6, 5, 8, 7, 10, 9, 12, 11, 15, 14, 16, 13, 17, 18, 19, 20, 21, 22, 24, 23, 28, 25, 26, 27, 30, 29, 32, 33, 34, 31, 35, 36, 37, 40, 38, 39, 43, 42, 41, 44, 45, 46, 47, 48, 49, 52, 50, 51, 54, 53, 56, 55, 58, 57, 61, 62, 60, 59, 63, 64, 65, 66, 67, 70, 68, 69, 72, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Inverse: A167905; A167904(n) = a(a(n)). [Reinhard Zumkeller, Nov 15 2009] Conjectured to be a permutation of the natural numbers. - Derek Orr, Jun 01 2015 LINKS EXAMPLE 9,10,11,12,... are the positive integers not occurring among the first 8 terms of the sequence. a(8) + 9 = 16, which is not squarefree. a(8) + 10 = 17, which is squarefree. So a(9) = 10. MATHEMATICA f[s_] := Block[{k = 1}, While[MemberQ[s, k] || Max @@ Last /@ FactorInteger[(s[[ -1]] + k)] > 1, k++ ]; Append[s, k]]; Nest[f, {1}, 75] (* Ray Chandler, Sep 06 2006 *) PROG (PARI) v=[1]; n=1; while(n<100, if(issquarefree(v[#v]+n)&&!vecsearch(vecsort(v), n), v=concat(v, n); n=0); n++); v \\ Derek Orr, Jun 01 2015 CROSSREFS Cf. A167907, A075380. [Reinhard Zumkeller, Nov 15 2009] Sequence in context: A123503 A123717 A123718 * A167905 A285039 A260307 Adjacent sequences:  A121875 A121876 A121877 * A121879 A121880 A121881 KEYWORD nonn AUTHOR Leroy Quet, Aug 31 2006 EXTENSIONS Extended by Ray Chandler, Sep 06 2006 STATUS approved

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 January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)