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!)
A015515 a(1) = 1, a(n) = Sum_{k=1..n-1} ((12^k - 1)/11)*a(k). 10
1, 1, 14, 2212, 4171832, 94375183504, 25618521062894816, 83450744014073963641408, 3262026661649164626974053098368, 1530121919008888925087797696409496422656, 8612828743790947623482719127044813092555596516864 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = ((12^(n-1) + 10)/11) * a(n-1). - Vincenzo Librandi, Nov 12 2012
MATHEMATICA
Join[{1}, RecurrenceTable[{a[2]==1, a[n]==(12^(n-1)+10)/11 a[n-1]}, a, {n, 12}]] (* Harvey P. Dale, Mar 10 2013 *)
PROG
(Magma) [n le 2 select 1 else ((12^(n-1) + 10)/11) * Self(n-1): n in [1..15]]; // Vincenzo Librandi, Nov 12 2012
(SageMath)
def a(n, m) -> int: # a = A015515
return 1 if (n<3) else (m^(n-1)+m-2)*a(n-1, m)//(m-1)
[a(n, 12) 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), A015511 (m=9), A015512 (m=10), A015513 (m=11), this sequence (m=12).
Sequence in context: A258487 A206753 A279577 * A183580 A080690 A268424
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 April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)