This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109366 a(-1)=0, a(0)=1 and recursively a(n) = prime(n)*(a(n-1)+a(n-2)). 2
 1, 2, 9, 55, 448, 5533, 77753, 1415862, 28378685, 685274581, 20695944714, 662817798145, 25290008485783, 1064065877641048, 46842303103453733, 2251599342111454707, 121817407196390147320, 7320071385771594519593 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS MAPLE A109366 := proc(n) if n<= 0 then n+1; else ithprime(n)*(procname(n-1)+procname(n-2)) ; end if; end proc: seq(A109366(n), n=0..20) ; # R. J. Mathar, Sep 15 2011 CROSSREFS Cf. A109365. Sequence in context: A231172 A009363 A069564 * A241457 A229208 A154749 Adjacent sequences:  A109363 A109364 A109365 * A109367 A109368 A109369 KEYWORD nonn AUTHOR Giorgio Balzarotti, Aug 23 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.