The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A109365 a(-1)=a(0)=1 and recursively a(n) = prime(n)*(a(n-1)+a(n-2)). 2

%I #8 Aug 08 2015 21:58:45

%S 1,4,15,95,770,9515,133705,2434740,48800455,1178409485,35589088260,

%T 1139792430095,43489116179135,1829785252978430,80550797873775295,

%U 3871887406957425075,209479224856053619610,12587715623517651636415

%N a(-1)=a(0)=1 and recursively a(n) = prime(n)*(a(n-1)+a(n-2)).

%p A109365 := proc(n) if n<= 0 then 1; else ithprime(n)*(procname(n-1)+procname(n-2)) ; end if; end proc: # _R. J. Mathar_, Sep 15 2011

%Y Cf. A109366.

%K nonn

%O 0,2

%A _Giorgio Balzarotti_, Aug 23 2005

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 15 04:25 EDT 2024. Contains 372536 sequences. (Running on oeis4.)