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!)
A015487 a(0)=1, a(1)=3, a(n) = sum_{k=0}^{k=n-1} 3^k a(k). 0
1, 3, 10, 100, 2800, 229600, 56022400, 40896352000, 89481218176000, 587175753670912000, 11557967535258231808000, 682497982956998588262400000, 120903152684866385913507635200000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..12.

FORMULA

a(n) = (3^(n-2) + 1) * a(n-1). - Vincenzo Librandi, Nov 10 2012

PROG

(Magma) I:=[1, 3, 10]; [n le 3 select I[n] else (3^(n-2)+1)*Self(n-1): n in [1..15]]; // Vincenzo Librandi, Nov 10 2012

CROSSREFS

Sequence in context: A013262 A013267 A013268 * A326428 A260813 A062013

Adjacent sequences: A015484 A015485 A015486 * A015488 A015489 A015490

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

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 February 7 20:37 EST 2023. Contains 360131 sequences. (Running on oeis4.)