Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A203464
Numbers n such that 65 divides 4n^2 + 1; alternately, numbers which are 4, 9, 56, or 61 mod 65.
1
4, 9, 56, 61, 69, 74, 121, 126, 134, 139, 186, 191, 199, 204, 251, 256, 264, 269, 316, 321, 329, 334, 381, 386, 394, 399, 446, 451, 459, 464, 511, 516, 524, 529, 576, 581, 589, 594, 641, 646, 654, 659, 706, 711, 719, 724, 771, 776, 784, 789, 836, 841, 849
OFFSET
1,1
COMMENTS
The sequence is infinite, since every number of the form 65*k + 56 is a member. - Arkadiusz Wesolowski, Oct 29 2013
REFERENCES
Wacław Sierpiński, 200 zadan z elementarnej teorii liczb, Warsaw: PZWS, 1964, pp. 5, 29.
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..10000
W. Sierpiński, 250 Problems in Elementary Number Theory, (Modern Analytic and Computational Methods in Science and Mathematics, No. 26), American Elsevier Publishing Co., Inc., New York; PWN Polish Scientific Publishers, Warsaw, 1970, pp. 1, 23.
FORMULA
From Bruno Berselli, Jan 12 2012: (Start)
G.f.: x*(4+5*x+47*x^2+5*x^3+4*x^4)/((1-x)^2*(1+x+x^2+x^3)).
a(n) = -a(-n+1) = (1/8)*(130*n+78*i^(n*(n+1))-45*(-1)^n-65), where i=sqrt(-1).
Sum(a(i), i=1..n) = a(A000982(n))+2*((-1)^n+1). (End)
MATHEMATICA
Select[Range[850], Divisible[4*#^2 + 1, 65] &]
Flatten[Table[65*k + n, {k, 0, 12}, {n, {4, 9, 56, 61}}]]
PROG
(PARI) for(n=4, 850, if((4*n^2+1)%65==0, print1(n, ", ")))
(PARI) forstep(n=4, 1e3, [5, 47, 5, 8], print1(n", ")) \\ Charles R Greathouse IV, Jan 13 2012
(Magma) m:=54; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(x*(4+5*x+47*x^2+5*x^3+4*x^4)/((1-x)^2*(1+x+x^2+x^3)))); // Bruno Berselli, Jan 12 2012
(Maxima) makelist((1/8)*(130*n+78*%i^(n*(n+1))-45*(-1)^n-65), n, 1, 53); /* Bruno Berselli, Jan 12 2012 */
CROSSREFS
Cf. A053755.
Sequence in context: A242036 A069507 A219894 * A360514 A358446 A152284
KEYWORD
nonn,easy
AUTHOR
STATUS
approved