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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127397 a(0)=0; a(n) = smallest positive integer not occurring earlier in the sequence such that a(n-1)+a(n) = j^k, j = any positive integer, k = any integer >= 2. 3
 0, 1, 3, 5, 4, 12, 13, 14, 2, 6, 10, 15, 17, 8, 19, 30, 34, 47, 53, 11, 16, 9, 7, 18, 31, 33, 48, 52, 29, 20, 44, 37, 27, 22, 42, 39, 25, 24, 40, 41, 23, 26, 38, 43, 21, 28, 36, 45, 55, 66, 59, 62, 63, 58, 67, 54, 46, 35, 65, 56, 69, 75, 50, 71, 57, 64, 61, 60, 68, 32, 49, 51, 70 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Rémy Sigrist, Table of n, a(n) for n = 0..10000 MATHEMATICA f[n_] := n == 1 || GCD @@ Last /@ FactorInteger[n] > 1; g[l_List] := Block[{k = 1}, While[MemberQ[l, k] || ! f[k + l[[ -1]]], k++ ]; Append[l, k]]; Nest[g, {0}, 73] (* Ray Chandler, Jan 22 2007 *) CROSSREFS Cf. A001597, A034175, A127398. Sequence in context: A078439 A007063 A335500 * A284048 A326119 A201271 Adjacent sequences: A127394 A127395 A127396 * A127398 A127399 A127400 KEYWORD nonn,look AUTHOR Leroy Quet, Jan 12 2007 EXTENSIONS Extended by Ray Chandler, Jan 22 2007 STATUS approved

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.

Last modified April 1 19:13 EDT 2023. Contains 361695 sequences. (Running on oeis4.)