login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105067 n^11 + n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1. 4
1, 12, 4095, 265720, 5592405, 61035156, 435356467, 2306881200, 9817068105, 35303692060, 111111111111, 313842837672, 810554586205, 1941507093540, 4361070182715, 9267595563616, 18764998447377, 36413889826860 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index to sequences with linear recurrences with constant coefficients, signature (56,-1372,19208,-168070,941192,-3294172,6588344,-5764801).

FORMULA

Factorization of the polynomial into irreducible components over integers: n^11 + n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 = +/- (n + 1) * (n^2 - n + 1) * (n^2 + 1) * (n^2 + n + 1) * (n^4 - n^2 + 1). - Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 06 2005

PROG

(MAGMA) [n^11 + n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1: n in [0..30]]; // Vincenzo Librandi, May 01 2011

(PARI) a(n)=polcyclo(11, n)+n^11 \\ Charles R Greathouse IV, Sep 03 2011

CROSSREFS

Cf. A002061, A053698, A053699, A053700, A053716, A053717, A102909, A103623, A060885, A060887.

Sequence in context: A012609 A159395 A099186 * A096732 A127233 A169657

Adjacent sequences:  A105064 A105065 A105066 * A105068 A105069 A105070

KEYWORD

nonn,easy

AUTHOR

Douglas Winston (douglas.winston(AT)srupc.com), Apr 05 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 12:58 EST 2012. Contains 205482 sequences.