|
|
A053755
|
|
a(n) = 4*n^2 + 1.
|
|
69
|
|
|
1, 5, 17, 37, 65, 101, 145, 197, 257, 325, 401, 485, 577, 677, 785, 901, 1025, 1157, 1297, 1445, 1601, 1765, 1937, 2117, 2305, 2501, 2705, 2917, 3137, 3365, 3601, 3845, 4097, 4357, 4625, 4901, 5185, 5477, 5777, 6085, 6401, 6725, 7057
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Subsequence of A004613: all numbers in this sequence have all prime factors of the form 4k+1. E.g., 40001 = 13*17*181, 13 = 4*3 + 1, 17 = 4*4 + 1, 181 = 4*45 + 1. - Cino Hilliard, Aug 26 2006, corrected by Franklin T. Adams-Watters, Mar 22 2011
Solutions x of the Mordell equation y^2 = x^3 - 3a^2 - 1 for a = 0, 1, 2, ... - Michel Lagneau, Feb 12 2010
For n >= 1, a(n) is numerator of radius r(n) of circle with sagitta = n and cord length = 1. The denominator is A008590(n). - Kival Ngaokrajang, Jun 13 2014
a(n)+6 is prime for n = 0..6 and for n = 15..20. - Altug Alkan, Sep 28 2015
|
|
REFERENCES
|
Donald E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, 1997, Vol. 1, exercise 1.2.1 Nr. 11, p. 19.
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: (1 + 2*x + 5*x^2)/(1-x)^3.
a(n) = 3a(n-1) - 3a(n-2) + a(n-3). (End)
Equals binomial transform of [1, 4, 8, 0, 0, 0, ...]. - Gary W. Adamson, Apr 30 2008
a(n+1) = denominator of Sum_{k=0..n} (-1)^n*(2*n + 1)^3/((2*n + 1)^4 + 4), see Knuth reference. - Reinhard Zumkeller, Apr 11 2010
a(n) = ((2*n - 1)^2 + (2*n + 1)^2)/2. - J. M. Bergot, May 31 2012
Sum_{n>=0} 1/a(n) = (1 + (Pi/2)*coth(Pi/2))/2.
Sum_{n>=0} (-1)^n/a(n) = (1 + (Pi/2)*csch(Pi/2))/2. (End)
Product_{n>=0} (1 + 1/a(n)) = sqrt(2)*csch(Pi/2)*sinh(Pi/sqrt(2)).
Product_{n>=1} (1 - 1/a(n)) = (Pi/2)*csch(Pi/2). (End)
|
|
MAPLE
|
with (combinat):seq(fibonacci(3, 2*n), n=0..42); # Zerinvary Lajos, Apr 21 2008
|
|
MATHEMATICA
|
CoefficientList[Series[(1 + 2 x + 5 x^2) / (1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jun 26 2013 *)
LinearRecurrence[{3, -3, 1}, {1, 5, 17}, 50] (* Harvey P. Dale, Dec 28 2021 *)
|
|
PROG
|
(PARI) for(x=0, 100, print1(4*x^2+1", ")) \\ Cino Hilliard, Aug 26 2006
(Magma) m:=50; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!((1+2*x+5*x^2)/((1-x)^3))); /* or */ I:=[1, 5]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2)+8: n in [1..50]]; // Vincenzo Librandi, Jun 26 2013
(Haskell)
(Python) for n in range(0, 50): print(4*n**2+1, end=', ') # Stefano Spezia, Nov 01 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Stuart M. Ellerstein (ellerstein(AT)aol.com), Apr 06 2000
|
|
EXTENSIONS
|
Equation corrected, and examples that were based on a different offset removed, by R. J. Mathar, Mar 18 2010
|
|
STATUS
|
approved
|
|
|
|