A347161 -id:A347161 - cp's OEIS frontend

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

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 28, 1, 1, 153, 1, 1, 28, 1, 126, 28, 1, 1, 28, 126, 1, 28, 1, 1, 153, 1, 1, 28, 1, 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

Ilya Gutkovskiy, Aug 20 2021

nonn

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A001158, A051000, A333805, A333807, A339354, A347161.

Table[DivisorSum[n, #^3 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 75}]
nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^3 x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
scod[n_]:=Total[Select[Divisors[n],#Harvey P. Dale, Jan 07 2022 *)

a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (dMichel Marcus, Aug 21 2021

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

A347173 Sum of squares of odd divisors of n that are <= sqrt(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 1, 1, 10, 26, 1, 10, 1, 1, 35, 1, 1, 10, 1, 26, 10, 1, 1, 10, 26, 1, 10, 1, 1, 35, 1, 1, 10, 50, 26, 10, 1, 1, 10, 26, 50, 10, 1, 1, 35, 1, 1, 59, 1, 26, 10, 1, 1, 10, 75, 1, 10, 1, 1, 35, 1, 50, 10, 1, 26

Offset: 1

Ilya Gutkovskiy, Aug 21 2021

			a(18) = 10 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 squares of 1 and 3 then add them i.e., a(18) = 1^2 + 3^2 = 10. - _David A. Corneth_, Feb 24 2024

David A. Corneth, Table of n, a(n) for n = 1..10000

Cf. A001157, A050999, A069288, A069289, A095118, A347161, A347174, A347175.

Table[DivisorSum[n, #^2 &, # <= Sqrt[n] && OddQ[#] &], {n, 1, 80}]
nmax = 80; CoefficientList[Series[Sum[(2 k - 1)^2 x^((2 k - 1)^2)/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

a(n) = sum(k=0, sqrtint(n), if ((k%2) && !(n%k), k^2)); \\ Michel Marcus, Aug 22 2021

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]^2
		,
			return(res)
		)
	); res
} \\ David A. Corneth, Feb 24 2024

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

A347172 Sum of 4th powers of odd divisors of n that are < sqrt(n).

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 707, 1, 1, 82, 1, 626, 82, 1, 1, 82, 626, 1, 82, 1, 1, 707, 1, 1, 82, 1, 626, 82, 1, 1, 82, 626, 2402, 82, 1, 1, 707, 1, 1, 2483, 1, 626, 82, 1, 1, 82, 3027, 1, 82, 1, 1, 707

Offset: 1

Ilya Gutkovskiy, Aug 21 2021

nonn

Cf. A001159, A051001, A333805, A333807, A347142, A347161, A347162.

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

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

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A347173 Sum of squares of odd divisors of n that are <= sqrt(n).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A347172 Sum of 4th powers of odd divisors of n that are < sqrt(n).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula