cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-6 of 6 results.

A005065 Sum of 4th powers of primes dividing n.

Original entry on oeis.org

0, 16, 81, 16, 625, 97, 2401, 16, 81, 641, 14641, 97, 28561, 2417, 706, 16, 83521, 97, 130321, 641, 2482, 14657, 279841, 97, 625, 28577, 81, 2417, 707281, 722, 923521, 16, 14722, 83537, 3026, 97, 1874161, 130337, 28642, 641, 2825761, 2498, 3418801, 14657, 706, 279857, 4879681, 97, 2401, 641, 83602, 28577, 7890481, 97
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Primes are taken without multiplicity, e.g., 12 = 2*2*3, and a(12) = 2^4+3^4 = 97. - Harvey P. Dale, Jul 16 2014
Inverse Möbius transform of n^4 * c(n), where c(n) is the prime characteristic (A010051). - Wesley Ivan Hurt, Jun 22 2024

Links

Crossrefs

Column k=4 of A322080.
Cf. A000583, A005068, A005073, A005077, A005081, A005085, A008472, A059841, A079978.
Sum of the k-th powers of the primes dividing n for k=0..10 : A001221 (k=0), A008472 (k=1), A005063 (k=2), A005064 (k=3), this sequence (k=4), A351193 (k=5), A351194 (k=6), A351195 (k=7), this sequence (k=8), A351197 (k=9), A351198 (k=10).
Cf. A010051.

Programs

  • Maple
    A005065 := proc(n)
        add(d^4, d= numtheory[factorset](n)) ;
end proc;
seq(A005065(n),n=1..40) ; # R. J. Mathar, Nov 08 2011
  • Mathematica
    Join[{0},Table[Total[Transpose[FactorInteger[n]][[1]]^4],{n,2,40}]] (* Harvey P. Dale, Jul 16 2014 *)
Array[DivisorSum[#, #^4 &, PrimeQ] &, 54] (* Michael De Vlieger, Jul 11 2017 *)
  • PARI
    a(n) = my(f=factor(n)); sum(k=1, #f~, f[k,1]^4); \\ Michel Marcus, Jul 11 2017
  • Python
    from sympy import primefactors
def a(n): return sum(p**4 for p in primefactors(n))
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Jul 11 2017
  • Scheme
    (define (A005065 n) (if (= 1 n) 0 (+ (A000583 (A020639 n)) (A005065 (A028234 n))))) ;; Antti Karttunen, Jul 10 2017

Formula

Additive with a(p^e) = p^4.
From Antti Karttunen, Jul 11 2017: (Start)
a(n) = A005068(n) + 16*A059841(n).
a(n) = A005081(n) + A005085(n) + 16*A059841(n).
a(n) = A005073(n) + A005077(n) + 81*A079978(n).
(End)
G.f.: Sum_{k>=1} prime(k)^4*x^prime(k)/(1 - x^prime(k)). - Ilya Gutkovskiy, Dec 24 2018
a(n) = Sum_{p|n, p prime} p^4. - Wesley Ivan Hurt, Feb 04 2022
a(n) = Sum_{d|n} d^4 * c(d), where c = A010051. - Wesley Ivan Hurt, Jun 22 2024

Extensions

More terms from Antti Karttunen, Jul 10 2017

A005069 Sum of odd primes dividing n.

Original entry on oeis.org

0, 0, 3, 0, 5, 3, 7, 0, 3, 5, 11, 3, 13, 7, 8, 0, 17, 3, 19, 5, 10, 11, 23, 3, 5, 13, 3, 7, 29, 8, 31, 0, 14, 17, 12, 3, 37, 19, 16, 5, 41, 10, 43, 11, 8, 23, 47, 3, 7, 5, 20, 13, 53, 3, 16, 7, 22, 29, 59, 8, 61, 31, 10, 0, 18, 14, 67, 17, 26, 12, 71, 3, 73, 37, 8, 19, 18, 16, 79
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Primes counted without multiplicity. - Harvey P. Dale, Aug 28 2019

Links

Crossrefs

Cf. A000265, A005066, A005067, A005068, A005078, A005082, A008472, A020639, A028234, A059841.

Programs

  • Mathematica
    a = {0, 0}; For[n = 3, n < 80, n++, su = 0; b = FactorInteger[n]; For[i = 1, i < Length[b] + 1, i++, If[OddQ[b[[i, 1]]], su = su + b[[i, 1]]]]; AppendTo[a, su]]; a (* Stefan Steinerberger, Jun 02 2007 *)
Array[DivisorSum[#, # &, And[PrimeQ@ #, OddQ@ #] &] &, 79] (* Michael De Vlieger, Jul 11 2017 *)
Join[{0},Table[Total[FactorInteger[n][[All,1]]/.(2->0)],{n,2,100}]] (* Harvey P. Dale, Aug 28 2019 *)
  • PARI
    a(n) = my(f=factor(n)); sum(k=1, #f~, if (((p=f[k,1])%2) == 1, p)); \\ Michel Marcus, Jul 11 2017
  • Scheme
    (define (A005069 n) (cond ((= 1 n) 0) ((even? n) (A005069 (/ n 2))) (else (+ (A020639 n) (A005069 (A028234 n)))))) ;; Antti Karttunen, Jul 10 2017

Formula

Additive with a(p^e) = 0 if p = 2, p otherwise.
G.f.: Sum_{k>=2} prime(k)*x^prime(k)/(1 - x^prime(k)). - Ilya Gutkovskiy, Dec 24 2016
From Antti Karttunen, Jul 10 & 11 2017: (Start)
a(1) = 0; after which, for even n: a(n) = a(n/2), for odd n: a(n) = A020639(n) + a(A028234(n)).
a(n) = A008472(A000265(n)) = A008472(n) - 2*A059841(n).
a(n) = A005078(n) + A005082(n).
(End)

Extensions

More terms from Stefan Steinerberger, Jun 02 2007

A005067 Sum of cubes of odd primes dividing n.

Original entry on oeis.org

0, 0, 27, 0, 125, 27, 343, 0, 27, 125, 1331, 27, 2197, 343, 152, 0, 4913, 27, 6859, 125, 370, 1331, 12167, 27, 125, 2197, 27, 343, 24389, 152, 29791, 0, 1358, 4913, 468, 27, 50653, 6859, 2224, 125, 68921, 370, 79507, 1331, 152, 12167, 103823, 27, 343, 125, 4940, 2197, 148877, 27, 1456, 343, 6886, 24389, 205379, 152
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Links

Crossrefs

Cf. A000265, A000578, A005064, A005066, A005068, A005069, A020639, A028234, A065091.

Programs

Formula

Additive with a(p^e) = 0 if p = 2, p^3 otherwise.
G.f.: Sum_{k>=2} prime(k)^3*x^prime(k)/(1 - x^prime(k)). - Ilya Gutkovskiy, Jan 06 2017
From Antti Karttunen, Jul 10 2017: (Start)
a(1) = 0; after which, for even n: a(n) = a(n/2), for odd n: a(n) = A020639(n)^3 + a(A028234(n)).
a(n) = A005064(A000265(n)).
(End)

Extensions

More terms from Antti Karttunen, Jul 10 2017

A005066 Sum of squares of odd primes dividing n.

Original entry on oeis.org

0, 0, 9, 0, 25, 9, 49, 0, 9, 25, 121, 9, 169, 49, 34, 0, 289, 9, 361, 25, 58, 121, 529, 9, 25, 169, 9, 49, 841, 34, 961, 0, 130, 289, 74, 9, 1369, 361, 178, 25, 1681, 58, 1849, 121, 34, 529, 2209, 9, 49, 25, 298, 169, 2809, 9, 146, 49, 370, 841, 3481, 34, 3721, 961, 58, 0, 194, 130, 4489, 289, 538, 74, 5041, 9, 5329, 1369
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Links

Crossrefs

Cf. A000265, A000290, A005063, A005067, A005068, A005069, A005079, A005083, A020639, A028234.

Programs

  • Mathematica
    Table[Total[Select[Divisors[n],OddQ[#]&&PrimeQ[#]&]^2],{n,60}] (* Harvey P. Dale, May 02 2012 *)
Array[DivisorSum[#, #^2 &, And[PrimeQ@ #, OddQ@ #] &] &, 74] (* Michael De Vlieger, Jul 11 2017 *)
f[2, e_] := 0; f[p_, e_] := p^2; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Jun 20 2022 *)
  • PARI
    a(n) = sumdiv(n, d, ((d%2) && isprime(d))*d^2); \\ Michel Marcus, Jan 04 2017
  • Python
    from sympy import primefactors
def a(n): return sum(p**2 for p in primefactors(n) if p % 2)
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Jul 11 2017
  • Scheme
    (define (A005066 n) (cond ((= 1 n) 0) ((even? n) (A005066 (/ n 2))) (else (+ (A000290 (A020639 n)) (A005066 (A028234 n)))))) ;; Antti Karttunen, Jul 10 2017

Formula

Additive with a(p^e) = 0 if p = 2, p^2 otherwise.
G.f.: Sum_{k>=2} prime(k)^2*x^prime(k)/(1 - x^prime(k)). - Ilya Gutkovskiy, Jan 04 2017
From Antti Karttunen, Jul 10 & 11 2017: (Start)
a(1) = 0; after which, for even n: a(n) = a(n/2), for odd n: a(n) = A020639(n)^2 + a(A028234(n)).
a(n) = A005063(A000265(n)).
a(n) = A005079(n) + A005083(n).
(End)

Extensions

More terms from Antti Karttunen, Jul 10 2017

A347158 Sum of 4th powers of distinct prime divisors of n that are < sqrt(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 16, 0, 16, 0, 16, 0, 97, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 722, 0, 16, 81, 16, 625, 97, 0, 16, 81, 641, 0, 97, 0, 16, 706, 16, 0, 97, 0, 641, 81, 16, 0, 97, 625, 2417, 81, 16, 0, 722, 0, 16, 2482, 16, 625, 97, 0, 16, 81, 3042
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Cf. A001159, A005065, A005068, A333806, A333808, A347142, A347156, A347157.

Programs

  • Mathematica
    Table[DivisorSum[n, #^4 &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 70}]
nmax = 70; CoefficientList[Series[Sum[Prime[k]^4 x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

Formula

G.f.: Sum_{k>=1} prime(k)^4 * x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).

A347160 Sum of 4th powers of distinct prime divisors of n that are <= sqrt(n).

Original entry on oeis.org

0, 0, 0, 16, 0, 16, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 97, 0, 16, 81, 16, 0, 97, 625, 16, 81, 16, 0, 722, 0, 16, 81, 16, 625, 97, 0, 16, 81, 641, 0, 97, 0, 16, 706, 16, 0, 97, 2401, 641, 81, 16, 0, 97, 625, 2417, 81, 16, 0, 722, 0, 16, 2482, 16, 625, 97, 0, 16, 81, 3042
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Cf. A001159, A005065, A005068, A063962, A097974, A098002, A347143, A347158, A347159.

Programs

  • Mathematica
    Table[DivisorSum[n, #^4 &, # <= Sqrt[n] && PrimeQ[#] &], {n, 1, 70}]
nmax = 70; CoefficientList[Series[Sum[Prime[k]^4 x^(Prime[k]^2)/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

Formula

G.f.: Sum_{k>=1} prime(k)^4 * x^(prime(k)^2) / (1 - x^prime(k)).
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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