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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167398 a(n) = Fibonacci(11*n). 2

%I #12 Sep 08 2022 08:45:48

%S 0,89,17711,3524578,701408733,139583862445,27777890035288,

%T 5527939700884757,1100087778366101931,218922995834555169026,

%U 43566776258854844738105,8670007398507948658051921

%N a(n) = Fibonacci(11*n).

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (199, 1).

%F a(0)=0, a(1)=89; a(n) = 199*a(n-1) + a(n-2) for n > 1.

%t (*1*)Table[Fibonacci[11k],{k,0,20}]

%t (*2*){a,b}={0,89};Do[Print[c={a,b}.{1,199}];a=b;b=c,{20}]

%o (Magma) [Fibonacci(11*n): n in [0..100]]; // _Vincenzo Librandi_, Apr 17 2011

%Y Cf. A134498 Fibonacci(7n).

%K nonn

%O 0,2

%A _Zak Seidov_, Nov 02 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:39 EDT 2024. Contains 371264 sequences. (Running on oeis4.)