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!)
A015511 a(1) = 1, a(n) = Sum_{k=1..n-1} ((9^k - 1)/8)*a(k). 10
1, 1, 11, 1012, 830852, 6133349464, 407444538242984, 243599680968409330048, 1310771150941736627904810368, 63477451180042308935531134194562816, 27666523379269090447091129488519658150671616 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = ((9^(n-1) + 7)/8) * a(n-1). - Vincenzo Librandi, Nov 12 2012
a(n) ~ QPochhammer(-63, 1/9) * 3^(n*(n-1)) / 2^(3*n+7). - Vaclav Kotesovec, May 03 2023
MATHEMATICA
a[n_, m_]:= a[n, m]= If[n<3, 1, (m^(n-1) +m-2)*a[n-1, m]/(m-1)];
Table[a[n, 9], {n, 30}] (* G. C. Greubel, May 03 2023 *)
Join[{1}, Table[7^n*QPochhammer[-1/7, 9, n]/2^(3*n + 1), {n, 2, 12}]] (* Vaclav Kotesovec, May 03 2023 *)
PROG
(Magma) [n le 2 select 1 else ((9^(n-1)+7)/8)*Self(n-1): n in [1..15]]; // Vincenzo Librandi, Nov 12 2012
(SageMath)
@CachedFunction # a = A015511
def a(n, m): return 1 if (n<3) else (m^(n-1)+m-2)*a(n-1, m)/(m-1)
[a(n, 9) for n in range(1, 31)] # G. C. Greubel, May 03 2023
CROSSREFS
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), A015506 (m=5), A015507 (m=6), A015508 (m=7), A015509 (m=8), this sequence (m=9), A015512 (m=10), A015513 (m=11), A015515 (m=12).
Sequence in context: A127962 A267606 A303786 * A065050 A099440 A073903
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 May 11 01:12 EDT 2024. Contains 372388 sequences. (Running on oeis4.)