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!)
A100279 a(n) = A100107(A000032(n)). 3

%I #22 Aug 01 2023 07:36:16

%S 4,1,5,11,30,200,5880,1149852,6643838880,7639424866275970,

%T 50755107359004694925071660,

%U 387739824812222466915538827541705412334750,19679776435706023589554719270187917683310683639911856695096924149852

%N a(n) = A100107(A000032(n)).

%p A000032 := proc(n) option remember; if n =0 then 2; elif n = 1 then 1; else A000032(n-1)+A000032(n-2) ; fi ; end: A100107 := proc(n) option remember ; local a,dvs,d ; a := 0: dvs := numtheory[divisors](n) ; for d in dvs do a := a+ A000032(d) ; od: RETURN(a) ; end: A100279 := proc(n) option remember ; A100107(A000032(n)) ; end: seq(A100279(n),n=0..15) ; # _R. J. Mathar_, Aug 21 2007

%t A100107[n_] := Total[LucasL[Divisors[n]]];

%t a[n_] := A100107[LucasL[n]];

%t Table[a[n], {n, 0, 12}] (* _Jean-François Alcover_, Aug 01 2023 *)

%Y Cf. A000032, A100107.

%K nonn,less

%O 0,1

%A _Jonathan Vos Post_, Dec 26 2004

%E Corrected and extended by _R. J. Mathar_, Aug 21 2007

%E Name corrected using formula by _R. J. Mathar_, _Andrey Zabolotskiy_, Apr 30 2021

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 April 19 17:39 EDT 2024. Contains 371797 sequences. (Running on oeis4.)