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!)
A015502 a(1) = 1, a(n) = Sum_{k=1..n-1} (3^k - 1)/2 * a(k). 11
1, 1, 5, 70, 2870, 350140, 127801100, 139814403400, 458731057555400, 4514831068460246800, 133300387296288786770000, 11806948504381482999365980000, 3137354163532752044074527571580000, 2500979519710095684958538548015855960000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = ((3^(n-1) + 1)/2) * a(n-1). - Vincenzo Librandi, Nov 11 2012
a(n) ~ c * 3^(n*(n-1)/2) / 2^(n+1), where c = A132323 = QPochhammer(-1, 1/3) = 3.129868... . - Vaclav Kotesovec, Mar 24 2017
MATHEMATICA
Flatten[{1, Table[QPochhammer[-1, 3, n]/2^(n+1), {n, 2, 15}]}] (* Vaclav Kotesovec, Mar 24 2017 *)
a[n_, m_]:= a[n, m]= If[n<3, 1, (m^(n-1)+m-2)*a[n-1, m]/(m-1)];
Table[a[n, 3], {n, 20}] (* G. C. Greubel, Apr 29 2023 *)
PROG
(Magma) [n le 2 select 1 else ((3^(n-1)+1)/2)*Self(n-1): n in [1..15]]; // Vincenzo Librandi, Nov 11 2012
(SageMath)
@CachedFunction # a = A015502
def a(n, m): return 1 if (n<3) else (m^(n-1) + m-2)*a(n-1, m)/(m-1)
[a(n, 3) for n in range(1, 31)] # G. C. Greubel, Apr 29 2023
CROSSREFS
Sequences with the recurrence a(n) = (m^(n-1) + m-2)*a(n-1)/(m-1): A036442 (m=2), this sequence (m=3), A015503 (m=4), A015506 (m=5), A015507 (m=6), A015508 (m=7), A015509 (m=8), A015511 (m=9), A015512 (m=10), A015513 (m=11), A015515 (m=12).
Cf. A156296.
Sequence in context: A370576 A174486 A135438 * A303291 A324229 A338989
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 28 08:12 EDT 2024. Contains 371236 sequences. (Running on oeis4.)