login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336783
Integers b where the number of cycles under iteration of sum of cubes of digits in base b is exactly four.
2
OFFSET
1,1
COMMENTS
Let b > 1 be an integer, and write the base b expansion of any nonnegative integer m as m = x_0 + x_1 b + ... +x_d b^d with x_d > 0 and 0 <= x_i < b for i=0,...,d.
Consider the map S_{x^3,b}: N to N, with S_{x^3,b}(m) := x_0^3+ ... + x_d^3.
It is known that the orbit set {m,S_{x^3,b}(m), S_{x^3,b}(S_{x^3,b}(m)), ...} is finite for all m>0. Each orbit contains a finite cycle, and for a given base b, the union of such cycles over all orbit sets is finite. Let us denote by L(x^3,i) the set of bases b such that the set of cycles associated to S_{x^3,b} consists of exactly i elements. In this notation, the sequence is the set of known elements of L(x^3,4).
Meanwhile, the known terms of the sequence L(x^3,1) is {2}, L(x^3,2) is empty, and L(x^3,3) is {3, 26}. It's undetermined whether the complete sequences are finite, if so, whether the above give all terms.
LINKS
H. Hasse and G. Prichett, A conjecture on digital cycles, J. reine angew. Math. 298 (1978), 8--15. Also on GDZ.
D. Lorenzini, M. Melistas, A. Suresh, M. Suwama, and H. Wang, Integer Dynamics, preprint.
FORMULA
Integers b where A194025(b) + A194281(b) = 4.
EXAMPLE
For instance, when b=5 the associated four cycles are (1),(28),(118) and (9,65,35).
CROSSREFS
Cf. A336744 and A336762 (sum of squares of digits).
Sequence in context: A174591 A065197 A300348 * A300433 A300767 A300637
KEYWORD
nonn,base,hard,more
AUTHOR
Haiyang Wang, Aug 04 2020
STATUS
approved