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!)
A015506 a(1) = 1, a(n) = Sum_{k=1}^{n-1} (5^k - 1)/4 a(k). 10

%I #13 Apr 30 2023 02:06:17

%S 1,1,7,224,35168,27501376,107447876032,2098671914657024,

%T 204950003169660992768,100073397447688408870744576,

%U 244319893042568615235897903058432,2982420752607212448380293251367177293824

%N a(1) = 1, a(n) = Sum_{k=1}^{n-1} (5^k - 1)/4 a(k).

%H G. C. Greubel, <a href="/A015506/b015506.txt">Table of n, a(n) for n = 1..50</a>

%F a(n) = ((5^(n-1) + 3)/4) * a(n-1). - _Vincenzo Librandi_, Nov 12 2012

%t a[n_, m_]:= a[n, m]= If[n<3, 1, (m^(n-1)+m-2)*a[n-1,m]/(m-1)];

%t Table[a[n, 5], {n, 20}] (* _G. C. Greubel_, Apr 29 2023 *)

%o (Magma) [n le 2 select 1 else ((5^(n-1)+3)/4)*Self(n-1): n in [1..15]]; // _Vincenzo Librandi_, Nov 12 2012

%o (SageMath)

%o @CachedFunction # a = A015506

%o def a(n,m): return 1 if (n<3) else (m^(n-1) + m-2)*a(n-1,m)/(m-1)

%o [a(n,5) for n in range(1,31)] # _G. C. Greubel_, Apr 29 2023

%Y Sequences with the recurrence a(n) = (m^(n-1) + m-2)*a(n-1)/(m-1): A036442 (m=2), A015502 (m=3), A015503 (m=4), this sequence (m=5), A015507 (m=6), A015508 (m=7), A015509 (m=8), A015511 (m=9), A015512 (m=10), A015513 (m=11), A015515 (m=12).

%K nonn,easy

%O 1,3

%A _Olivier GĂ©rard_

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 24 19:59 EDT 2024. Contains 371963 sequences. (Running on oeis4.)