|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 256.
D. H. Lehmer, Lacunary recurrence formulas for the numbers of Bernoulli and Euler, Annals Math., 36 (1935), 637-649.
Problem 47, Amer. Math. Monthly, 4 (1897), 25-28.
P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 288.
P. F. Teilhet, Note #2094, L'Intermed. Math., 10 (1903), pp. 235-238.
|
|
FORMULA
|
a(n) = 34a(n-1)-a(n-2)+16 = A002315(n)^2 = 2*A001653(n)^2-1 = 2*A008844(n)-1 = [A046176(n)*sqrt(2) ] = 6*A055792(n+1)-a(n-1)+4 = (6*A055792(n+2)+a(n-1)-20)/35. -Henry Bottomley (se16(AT)btinternet.com), Nov 13 2001
a(n) = sum(k=1, 2*n+1, 2^(k-1)*binomial(4*n+2, 2*k) ). - Zoltan Zachar (zachar(AT)fellner.sulinet.hu), Oct 03 2003
O.g.f.: = -(1+14*x+x^2)/((-1+x)*(1-34*x+x^2)) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 23 2007
|