login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060883 a(n) = n^6 + n^3 + 1. 7

%I #25 Jul 07 2019 11:36:42

%S 1,3,73,757,4161,15751,46873,117993,262657,532171,1001001,1772893,

%T 2987713,4829007,7532281,11394001,16781313,24142483,34018057,47052741,

%U 64008001,85775383,113390553,148048057,191116801,244156251,308933353

%N a(n) = n^6 + n^3 + 1.

%C a(n) = Phi_9((n) where Phi_k is the k-th cyclotomic polynomial.

%H Harry J. Smith, <a href="/A060883/b060883.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Cy#CyclotomicPolynomialsValuesAtX">Index to values of cyclotomic polynomials of integer argument</a>

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7, -21, 35, -35, 21, -7, 1).

%F G.f.: (1-4*x+73*x^2+274*x^3+325*x^4+50*x^5+x^6)/(1-x)^7. [_Colin Barker_, Apr 21 2012]

%p A060883 := proc(n)

%p numtheory[cyclotomic](9,n) ;

%p end proc:

%p seq(A060883(n),n=0..20) ; # _R. J. Mathar_, Feb 07 2014

%t Table[n^6+n^3+1,{n,0,30}] (* or *) LinearRecurrence[{7,-21,35,-35,21,-7,1},{1,3,73,757,4161,15751,46873},30] (* _Harvey P. Dale_, Jul 07 2019 *)

%o (PARI) a(n)={n^6 + n^3 + 1} \\ _Harry J. Smith_, Jul 13 2009

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, May 05 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)