A144386 A step cyclic recursion: a(n) = If[a(n - 1) - Prime[n] > 0, Abs[a(n - 1) - 2*n], If[a[n - 1] - Prime[n] < 0, Abs[a(n - 1) + 2*n], Fibonacci[n] - a(n - 1)]].

0, 1, 5, -3, 5, 15, 3, 17, 33, 15, 35, 13, 37, 63, 35, 65, 33, 67, 31, 69, 109, 67, 111, 65, 113, 63, 115, 61, 117, 59, 119, 181, 117, 183, 115, 185, 113, 187, 111, 189, 109, 191, 107, 193, 701408540, 701408450, 701408358, 701408264, 701408168, 701408070, 701407970

Offset

1,3

Links

Table of n, a(n) for n=1..51.

Formula

a(n) = If[a(n - 1) - Prime[n] > 0, Abs[a(n - 1) - 2*n], If[a[n - 1] - Prime[n] < 0, Abs[a(n - 1) + 2*n], Fibonacci[n] - a(n - 1)]].

Mathematica

a[0] = 0; a[1] = 1; a[n_] := a[n] = If[a[n - 1] - Prime[n] > 0, Abs[a[n - 1] - 2*n], If[a[n - 1] - Prime[n] < 0, Abs[a[n - 1] + 2*n], Fibonacci[n] - a[n - 1]]]; Table[a[n], {n, 0, 50}]

Crossrefs

Sequence in context: A361546 A128008 A265800 * A256787 A265782 A073685

Adjacent sequences: A144383 A144384 A144385 * A144387 A144388 A144389

Keyword

uned,sign

Author

Roger L. Bagula, Oct 01 2008

Status

approved