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!)
A005731 Related to n-th powers of polynomials.
(Formerly M0427)
4
1, 1, 2, 3, 2, 5, 2, 21, 2, 3, 1, 55, 3, 13, 2, 21, 2, 85, 1, 57, 2, 1, 1, 8855, 2, 15, 2, 39, 1, 29, 10, 651, 2, 1, 2, 935, 1, 37, 2, 399, 1, 2665, 1, 129, 2, 1, 1, 416185, 2, 21, 2, 15, 1, 4505, 2, 39, 14, 1, 1, 357599, 1, 305, 2, 651, 6, 5, 1, 201, 2, 39, 1, 10687985, 2, 73, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. Chinburg and M. Henriksen, Sums of k-th powers in the ring of polynomials with integer coefficients, Acta Arithmetica, 29 (1976), 227-250.
FORMULA
a(n) = A005729(n)/A005730(n).
PROG
(Python)
from itertools import count
from sympy import nextprime
def A005731(n):
c, p = 1, 2
while p < n:
if n%p:
for m in count(2):
if (p**m-1)//(p-1) > n:
break
for r in count(1):
q = (p**(m*r)-1)//(p**r-1)
if q > n:
break
if not n % q:
c *= p
break
else:
continue
if q <= n:
break
p = nextprime(p)
return c # Chai Wah Wu, Mar 10 2024
CROSSREFS
Sequence in context: A271774 A331602 A118176 * A132962 A046145 A103309
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Emeric Deutsch, Jan 24 2005
STATUS
approved

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 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)