|
|
A017638
|
|
a(n) = (12n+9)^10.
|
|
1
|
|
|
3486784401, 16679880978201, 1531578985264449, 34050628916015625, 362033331456891249, 2446194060654759801, 12157665459056928801, 48398230717929318249, 162889462677744140625, 480682838924478847449
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|