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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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 (list; graph; refs; listen; history; text; internal format)
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: A330523 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

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 17:12 EST 2021. Contains 349424 sequences. (Running on oeis4.)