The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017638 (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) = A017629(n)^10 = A011557(12n+9) = A011557(A017629(n)). - Wesley Ivan Hurt, Dec 02 2013 MAPLE A017638:=n->(12*n+9)^10; seq(A017638(n), n=0..20); # Wesley Ivan Hurt, Dec 02 2013 MATHEMATICA Table[(12n + 9)^10, {n, 0, 20}] (* Wesley Ivan Hurt, Dec 02 2013 *) CROSSREFS Sequence in context: A017170 A017386 A017506 * A221557 A217003 A159301 Adjacent sequences:  A017635 A017636 A017637 * A017639 A017640 A017641 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 10 17:00 EDT 2021. Contains 342852 sequences. (Running on oeis4.)