(MAGMAMagma) I:=[1, 23]; [n le 2 select I[n] else 22*Self(n-1) - Self(n-2): n in [1..20]]; // G. C. Greubel, Jan 13 2020
(MAGMAMagma) I:=[1, 23]; [n le 2 select I[n] else 22*Self(n-1) - Self(n-2): n in [1..20]]; // G. C. Greubel, Jan 13 2020
proposed
approved
editing
proposed
(MAGMA) I:=[1, 23]; [n le 2 select I[n] else 22*Self(n-1) - Self(n-2): n in [1..3020]]; // G. C. Greubel, Jan 13 2020
proposed
editing
editing
proposed
Numbers n such that 30*n^2 + 6 is a square.
a(n+2) = 22*a(n+1) - a(n) ; a(n+1) = 11*a(n) + 2*sqrt(30*a(n)^2 + 6)^0.5.
a(n) = A077421(n) + A077421(n-1). - R. J. Mathar, Feb 19 2016
a(n) = Chebyshev(n-1, 11) + Chebyshev(n-2, 11). - G. C. Greubel, Jan 13 2020
Table[n /. {ToRules[Reduce[n > 0 && k >= 0 && 30*n^2+6 == k^2, n, Integers] /. C[1] -> c]} // Simplify, {c, 1, 1620}] // Flatten // Union (* Jean-François Alcover, Dec 19 2013 *)
Rest@ CoefficientList[Series[x (1 + x)/(1 - 22 x 22x+ x^2), {x, 0, 1620}], x] (* Michael De Vlieger, Jul 14 2016 *)
Table[ChebyshevU[n-1, 11] + ChebyshevU[n-2, 11], {n, 20}] (* G. C. Greubel, Jan 13 2020 *)
(PARI) vector(20, n, polchebyshev(n-1, 2, 11) + polchebyshev(n-2, 2, 11) ) \\ G. C. Greubel, Jan 13 2020
(MAGMA) I:=[1, 23]; [n le 2 select I[n] else 22*Self(n-1) - Self(n-2): n in [1..30]]; // G. C. Greubel, Jan 13 2020
(Sage) [chebyshev_U(n-1, 11) + chebyshev_U(n-2, 11) for n in (1..20)] # G. C. Greubel, Jan 13 2020
(GAP) a:=[1, 23];; for n in [3..20] do a[n]:=22*a[n-1]-a[n-2]; od; a; # G. C. Greubel, Jan 13 2020
approved
editing
editing
approved
LinearRecurrence[{22, -1}, {1, 23}, 20] (* Harvey P. Dale, Sep 22 2017 *)
approved
editing
reviewed
approved
proposed
reviewed