A329291 -id:A329291 - cp's OEIS frontend

A329292 Least number m > 0 such that A101337(m)/m = n, or 0 if no such m exists.

1, 459, 3194922, 174961, 119564, 0, 13598

Offset: 1

M. F. Hasler, Nov 17 2019

Subsequence of A306360, therefore also finite.

{A329292=vector(vecmax(A329291),k, iferr(for(i=1,#A329291, A329291[i]==k&&error(k=A306360[i])),E,k))} \\ If A329291 is not complete, there may be erroneous 0's

a(n) = min { m in A306360 | A101337(m)/m = n }.

a(6)-a(7) from Chai Wah Wu, Nov 18 2019 using b-file of A306360

A334601 Positive integers m such that sum of cubes of the digits of m, t=A055012(m), is a multiple of m (m/A055012(m) is an integer >= 1).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 24, 27, 37, 48, 153, 370, 371, 407, 459

Offset: 1

Zak Seidov, May 07 2020 and May 12 2020

Corresponding values of t: 1, 8, 27, 64, 125, 216, 343, 512, 729, 72, 351, 370, 576, 153, 370, 371, 407, 918 (first 9 terms are all cubes).
Corresponding values of t/m: 1, 4, 9, 16, 25, 36, 49, 64, 81, 3, 13, 10, 12, 1, 1, 1, 1, 2 (first 9 terms are all squares).
The subsequence of numbers m such that sum of cubes of its digits is equal to m is A046197 \ {0}. - Bernard Schott, May 11 2020

			m = 459, t = 4^3 + 5^3 + 9^3 = 918, t/m = 2.

Cf. A005188, A046197, A046459, A055012, A055642, A101337, A306354, A306360, A306361, A329291.

Select[Range[500], Divisible[Plus @@ (IntegerDigits[#]^3), #] &] (* Amiram Eldar, May 11 2020 *)

isok(m) = my(d=digits(m)); sum(k=1, #d, d[k]^3) % m == 0; \\ Michel Marcus, May 14 2020

cp's OEIS Frontend

A329292 Least number m > 0 such that A101337(m)/m = n, or 0 if no such m exists.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Formula

Extensions