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!)
A197219 a(0) = 2, a(n) = Lucas(phi(n)) for n > 0. 4

%I #17 Nov 30 2022 17:26:00

%S 2,1,1,3,3,7,3,18,7,18,7,123,7,322,18,47,47,2207,18,5778,47,322,123,

%T 39603,47,15127,322,5778,322,710647,47,1860498,2207,15127,2207,103682,

%U 322,33385282,5778,103682,2207,228826127,322,599074578,15127,103682,39603

%N a(0) = 2, a(n) = Lucas(phi(n)) for n > 0.

%H Vincenzo Librandi, <a href="/A197219/b197219.txt">Table of n, a(n) for n = 0..200</a>

%F a(n) = A000032(A000010(n)) for n > 0.

%t Table[LucasL[EulerPhi[n]], {n, 0, 50}]

%o (Magma) [2], [Lucas(EulerPhi(n)): n in [1..60]]; // _Vincenzo Librandi_, Oct 13 2011

%o (PARI) for(n=0,30, print1(if(n==0,2, fibonacci(eulerphi(n)+1) + fibonacci(eulerphi(n)-1)), ", ")) \\ _G. C. Greubel_, Dec 22 2017

%Y Cf. A000010, A000032, A065449, A065451, A197218 (phi(Lucas(n))).

%K nonn

%O 0,1

%A _T. D. Noe_, Oct 12 2011

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 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)