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!)
A241406 Numbers n such that n^2 == -1 (mod 61). 2
11, 50, 72, 111, 133, 172, 194, 233, 255, 294, 316, 355, 377, 416, 438, 477, 499, 538, 560, 599, 621, 660, 682, 721, 743, 782, 804, 843, 865, 904, 926, 965, 987, 1026, 1048, 1087, 1109, 1148, 1170, 1209, 1231, 1270, 1292, 1331, 1353, 1392, 1414, 1453, 1475, 1514 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers n such that n == 11 or 50 (mod 61).
LINKS
FORMULA
G.f.: x*(11 + 39*x + 11*x^2)/((1 + x)*(1 - x)^2).
a(n) = a(n-1) + a(n-2) - a(n-3) for n>2.
a(n) = a(n-2) + 61 for all n>2.
a(n) = -11*(-1)^n + 61*floor(n/2).
MATHEMATICA
Select[Range[1500], PowerMod[#, 2, 61] == 60 &] (* or *) CoefficientList[Series[(11 + 39 x + 11 x^2)/((1 + x) (1 - x)^2), {x, 0, 100}], x]
PROG
(Magma) I:=[11, 50, 72]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..50]] /* or */ [-11*(-1)^n+61*Floor(n/2): n in [1..50]];
CROSSREFS
Cf. similar sequences listed in A155107.
Sequence in context: A284857 A241964 A306425 * A215728 A185019 A212560
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Apr 25 2014
STATUS
approved

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 June 8 00:48 EDT 2024. Contains 373206 sequences. (Running on oeis4.)