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!)
A029846 a(n) = a(n-1)*b(n-2)+2, b() given by A029758. 2

%I #10 Mar 16 2017 19:28:30

%S 1,3,5,7,23,347,109307,11878938227,141106591489900388627,

%T 19911070158545297149320104511797515190627,

%U 396450714858513044552818188364610837019759458190194070051140109393414330800390627

%N a(n) = a(n-1)*b(n-2)+2, b() given by A029758.

%D D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 6.2.3 (7) and (8).

%H Alois P. Heinz, <a href="/A029846/b029846.txt">Table of n, a(n) for n = 0..13</a>

%o (PARI) a(n)=if(n<3,max(0,1+2*n),2+a(n-1)*(a(n-1)-2)*(a(n-2)-2)/a(n-2)) /* _Michael Somos_, Feb 07 2004 */

%K easy,nonn

%O 0,2

%A _Don Knuth_

%E More terms from _N. J. A. Sloane_

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