OFFSET
0,2
COMMENTS
a(n) = 11111 in base n.
a(n) = Phi_5(n), where Phi_k is the k-th cyclotomic polynomial.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Carlos M. da Fonseca and Anthony G. Shannon, A formal operator involving Fermatian numbers, Notes Num. Theor. Disc. Math. (2024) Vol. 30, No. 3, 491-498.
Michael Penn, What base makes me a perfect square??, YouTube video, 2022.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
FORMULA
a(n) = n^4 + n^3 + n^2 + n + 1 =(n^5-1)/(n-1).
G.f.: (1 + 16*x^2 + 6*x^3 + x^4)/(1-x)^5. - Colin Barker, Jan 10 2012
E.g.f.: exp(x)*(1 + 4*x + 11*x^2 + 7*x^3 + x^4). - Stefano Spezia, Oct 03 2024
MAPLE
A053699 := proc(n)
numtheory[cyclotomic](5, n) ;
end proc:
seq(A053699(n), n=0..20) ; # R. J. Mathar, Feb 07 2014
MATHEMATICA
f[n_]:=((1+n+n^2+n^3+n^4)); Table[f[n], {n, 0, 6!}] (* Vladimir Joseph Stephan Orlovsky, Mar 03 2010 *)
Join[{1}, Table[Total[n^Range[0, 4]], {n, 40}]] (* Harvey P. Dale, Feb 02 2014 *)
PROG
(Magma) [n^4+n^3+n^2+n+1: n in [0..50]]; // Vincenzo Librandi, May 01 2011
(PARI) a(n)=polcyclo(5, n) \\ Charles R Greathouse IV, Jul 19 2011
(Maxima) A053699(n):=n^4 + n^3 + n^2 + n + 1$
makelist(A053699(n), n, 0, 30); /* Martin Ettl, Nov 07 2012 */
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
Henry Bottomley, Mar 23 2000
STATUS
approved