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!)
A015507 a(1) = 1, a(n) = Sum_{k=1..n-1} ((6^k - 1)/5)*a(k). 10
1, 1, 8, 352, 91520, 142405120, 1328924579840, 74403829376081920, 24994031979330942894080, 50376471215620688640734003200, 609214555257707874214915513922355200, 44204249911340791820804231319883906967142400 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = ((6^(n-1) + 4)/5) * a(n-1). - Vincenzo Librandi, Nov 12 2012
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, 6], {n, 20}] (* G. C. Greubel, Apr 29 2023 *)
PROG
(Magma) [n le 2 select 1 else ((6^(n-1)+4)/5)*Self(n-1): n in [1..15]]; // Vincenzo Librandi, Nov 12 2012
(SageMath)
@CachedFunction
def A015507(n): return 1 if (n<3) else (6^(n-1)+4)*A015507(n-1)/5
[A015507(n) for n in range(1, 21)] # 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), A015502 (m=3), A015503 (m=4), A015506 (m=5), this sequence (m=6), A015508 (m=7), A015509 (m=8), A015511 (m=9), A015512 (m=10), A015513 (m=11), A015515 (m=12).
Sequence in context: A221044 A221163 A000436 * A167256 A277656 A264198
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 9 04:27 EDT 2024. Contains 372341 sequences. (Running on oeis4.)