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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A176951 Let p = prime(n). Then a(n) = Fibonacci(p+1)/p if this is integer, otherwise a(n) = Fibonacci(p-1)/p if this is integer, and fall back to a(n)=0 if both are non-integer. 1
 1, 1, 0, 3, 5, 29, 152, 136, 2016, 10959, 26840, 1056437, 2495955, 16311831, 102287808, 1627690024, 10021808981, 25377192720, 1085424779823, 2681584376185, 17876295136009, 113220181313816, 1933742696582736 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS This differs only trivially from the better-defined A092330. - John Blythe Dobson, Sep 20 2014 LINKS Table of n, a(n) for n=1..23. MAPLE A176951aux := proc(n) if n = 0 then 0; elif combinat[fibonacci](n+1) mod n = 0 then combinat[fibonacci](n+1)/n ; elif combinat[fibonacci](n-1) mod n = 0 then combinat[fibonacci](n-1)/n ; else 0 ; end if; end proc: A176951 := proc(n) A176951aux(ithprime(n)) ; end proc: seq(A176951(n), n=1..20) ; # R. J. Mathar, Oct 29 2011 MATHEMATICA f[n_] = If[n == 0, 0, If[Mod[Fibonacci[n + 1], n] == 0, Fibonacci[n + 1]/n, If[Mod[Fibonacci[n - 1], n] == 0, Fibonacci[n - 1]/n, 0]]]; Table[f[Prime[n + 1]], {n, 0, 50}] PROG (PARI) a(n)=my(p=prime(n), t); t=fibonacci(p+1); if(t%p==0, t/p, t=fibonacci(p-1); if(t%p==0, t/p, 0)) \\ Charles R Greathouse IV, Oct 29 2011 CROSSREFS Cf. A092330. Sequence in context: A228502 A215663 A092330 * A082716 A352295 A283266 Adjacent sequences: A176948 A176949 A176950 * A176952 A176953 A176954 KEYWORD nonn AUTHOR Roger L. Bagula, Apr 29 2010 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 July 23 21:46 EDT 2024. Contains 374575 sequences. (Running on oeis4.)