OFFSET
0,1
COMMENTS
From Fermat's little theorem, it follows that all terms are congruent to 1 mod 11 except when n is congruent to 2 mod 11 (because for those n, 12*n+9 is a multiple of 11). - Alonso del Arte, Dec 02 2013
LINKS
Index entries for linear recurrences with constant coefficients, signature (11, -55, 165, -330, 462, -462, 330, -165, 55, -11, 1).
FORMULA
a(n) = (12*n+9)^10.
a(n) = 11*a(n-1)-55*a(n-2)+165*a(n-3)-330*a(n-4)+462*a(n-5)-462*a(n-6)+330*a(n-7)-165*a(n-8)+55*a(n-9)-11*a(n-10)+a(n-11). - Wesley Ivan Hurt, Nov 25 2021
MAPLE
MATHEMATICA
Table[(12n + 9)^10, {n, 0, 20}] (* Wesley Ivan Hurt, Dec 02 2013 *)
PROG
(Magma) [(12*n+9)^10 : n in [0..20]]; // Wesley Ivan Hurt, Nov 25 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved