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-4 of 4 results.

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

Original entry on oeis.org

0, 1, 1, 1, 1, 9, 1, 9, 1, 9, 1, 36, 1, 9, 28, 9, 1, 36, 1, 73, 28, 9, 1, 100, 1, 9, 28, 73, 1, 161, 1, 73, 28, 9, 126, 100, 1, 9, 28, 198, 1, 252, 1, 73, 153, 9, 1, 316, 1, 134, 28, 73, 1, 252, 126, 416, 28, 9, 1, 441, 1, 9, 371, 73, 126, 252, 1, 73, 28, 477, 1, 828, 1, 9, 153, 73, 344
Offset: 1

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Comments

Sum of cubes of divisors of n that are smaller than sqrt(n).

Crossrefs

Programs

  • Mathematica
    nmax = 77; CoefficientList[Series[Sum[k^3 x^(k (k + 1))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
    Table[DivisorSum[n, #^3 &, # < Sqrt[n] &], {n, 77}]
  • PARI
    a(n) = sumdiv(n, d, if (d^2 < n, d^3)); \\ Michel Marcus, Dec 02 2020

A347143 Sum of 4th powers of divisors of n that are <= sqrt(n).

Original entry on oeis.org

1, 1, 1, 17, 1, 17, 1, 17, 82, 17, 1, 98, 1, 17, 82, 273, 1, 98, 1, 273, 82, 17, 1, 354, 626, 17, 82, 273, 1, 723, 1, 273, 82, 17, 626, 1650, 1, 17, 82, 898, 1, 1394, 1, 273, 707, 17, 1, 1650, 2402, 642, 82, 273, 1, 1394, 626, 2674, 82, 17, 1, 2275, 1, 17, 2483, 4369, 626
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 19 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[DivisorSum[n, #^4 &, # <= Sqrt[n] &], {n, 1, 65}]
    nmax = 65; CoefficientList[Series[Sum[k^4 x^(k^2)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
  • PARI
    A347143(n) = { my(s=0); fordiv(n,d,if((d^2)>n,return(s)); s += (d^4)); (s); }; \\ Antti Karttunen, Aug 19 2021

Formula

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

A347174 Sum of cubes of odd divisors of n that are <= sqrt(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 126, 1, 28, 1, 1, 153, 1, 1, 28, 1, 126, 28, 1, 1, 28, 126, 1, 28, 1, 1, 153, 1, 1, 28, 344, 126, 28, 1, 1, 28, 126, 344, 28, 1, 1, 153, 1, 1, 371, 1, 126, 28, 1, 1, 28, 469, 1, 28, 1, 1, 153
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 21 2021

Keywords

Examples

			a(18) = 28 as the odd divisors of 18 are the divisors of 9 which are 1, 3 and 9. Of those, 1 and 3 are <= sqrt(18) so we find the cubes of 1 and 3 then add them i.e., a(18) = 1^3 + 3^3 = 28. - _David A. Corneth_, Feb 24 2024
		

Crossrefs

Programs

  • Mathematica
    Table[DivisorSum[n, #^3 &, # <= Sqrt[n] && OddQ[#] &], {n, 1, 75}]
    nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^3 x^((2 k - 1)^2)/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
  • PARI
    a(n) = sum(k=0, sqrtint(n), if ((k%2) && !(n%k), k^3)); \\ Michel Marcus, Aug 22 2021
    
  • PARI
    a(n) = {
    	my(s = sqrtint(n), res);
    	n>>=valuation(n, 2);
    	d = divisors(n);
    	for(i = 1, #d,
    		if(d[i] <= s,
    			res += d[i]^3
    		,
    			return(res)
    		)
    	); res
    } \\ David A. Corneth, Feb 24 2024

Formula

G.f.: Sum_{k>=1} (2*k - 1)^3 * x^((2*k - 1)^2) / (1 - x^(2*k - 1)).

A347159 Sum of cubes of distinct prime divisors of n that are <= sqrt(n).

Original entry on oeis.org

0, 0, 0, 8, 0, 8, 0, 8, 27, 8, 0, 35, 0, 8, 27, 8, 0, 35, 0, 8, 27, 8, 0, 35, 125, 8, 27, 8, 0, 160, 0, 8, 27, 8, 125, 35, 0, 8, 27, 133, 0, 35, 0, 8, 152, 8, 0, 35, 343, 133, 27, 8, 0, 35, 125, 351, 27, 8, 0, 160, 0, 8, 370, 8, 125, 35, 0, 8, 27, 476, 0, 35, 0, 8, 152
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 20 2021

Keywords

Crossrefs

Programs

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

Formula

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