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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200258 a(n) = Fibonacci(8n+7) mod Fibonacci(8n+1). 1
32, 1508, 70844, 3328160, 156352676, 7345247612, 345070285088, 16210958151524, 761569962836540, 35777577295165856, 1680784562909958692, 78961096879472892668, 3709490768772315996704, 174267105035419378952420, 8186844445895938494767036 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..600

Index entries for linear recurrences with constant coefficients, signature (47,-1).

FORMULA

From Bruno Berselli, Nov 17 2011: (Start)

G.f.: 4*x*(8+x)/(1-47*x+x^2).

a(n) = 47*a(n-1)-a(n-2).

a(n) = ((-5+3r)*(47+21r)^n-(5+3r)*(47-21r)^n)/(5*2^(n-1)) where r=sqrt(5). (End)

a(n) = 32*A049668(n) + 4*A049668(n-1). - R. J. Mathar, Nov 26 2011

MATHEMATICA

Table[Mod[Fibonacci[(8 n + 7)] , Fibonacci[(8 n + 1)]], {n, 1, 16}]

CoefficientList[Series[4*(8+x)/(1-47*x+x^2), {x, 0, 20}], x] (* Vincenzo Librandi, Jul 12 2012 *)

PROG

(MAGMA) I:=[32, 1508]; [n le 2 select I[n] else 47*Self(n-1)-Self(n-2): n in [1..20]]; // Vincenzo Librandi, Jul 12 2012

CROSSREFS

Sequence in context: A300809 A301448 A220577 * A122123 A013994 A281953

Adjacent sequences:  A200255 A200256 A200257 * A200259 A200260 A200261

KEYWORD

nonn,easy

AUTHOR

Artur Jasinski, Nov 15 2011

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 September 22 19:36 EDT 2021. Contains 347608 sequences. (Running on oeis4.)