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!)
A166169 a(n) = Lucas(n^2) = A000204(n^2) for n >= 1. 3

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

%S 1,7,76,2207,167761,33385282,17393796001,23725150497407,

%T 84722519070079276,792070839848372253127,19386725908489881939795601,

%U 1242282009792667284144565908482,208406472252232726621841472637412401

%N a(n) = Lucas(n^2) = A000204(n^2) for n >= 1.

%H Vincenzo Librandi, <a href="/A166169/b166169.txt">Table of n, a(n) for n = 1..35</a>

%F Logarithmic derivative of A166168.

%F a(n) = ((1 + sqrt(5))/2)^(n^2) + ((1 - sqrt(5))/2)^(n^2).

%F a(n) = Fibonacci(n^2 - 1) + Fibonacci(n^2 + 1).

%t Table[LucasL[n^2], {n, 1, 10}] (* _G. C. Greubel_, May 06 2016 *)

%o (PARI) a(n)=fibonacci(n^2-1)+fibonacci(n^2+1)

%o (Magma) [ Lucas(n^2) : n in [1..50]]; // _Vincenzo Librandi_, Apr 14 2011

%Y Cf. A166168, A000204, A000045.

%K nonn

%O 1,2

%A _Paul D. Hanna_, Oct 08 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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)