A375212 -id:A375212 - cp's OEIS frontend

Showing 1-1 of 1 results.

A377082 a(0) = 1, a(1) = 3, a(2) = 13; for n >= 2, a(n+1) = 2*3^((a(n)-1)/4) - 1.

Original entry on oeis.org

1, 3, 13, 53, 3188645

Offset: 0

N. Bradley Fox, Nathan Fox, Helen Grundman, Rachel Lynn, Changningphaabi Namoijam, Mary Vanderschoot, Oct 15 2024

nonn

The next term is too large to include.
a(n) is the least positive integer that requires n steps to reach 1 under iteration of the sum of squares of digits function in base 3 (A006287).
a(n) is also the least positive integer that requires n steps to reach 1 under iteration of the map A375212.

N. Bradley Fox et al., Elated Numbers, arXiv:2409.09863 [math.NT], 2024.
G. Lapointe, On finding the smallest happy numbers of any heights, arXiv:1904.12032 [math.NT], 2019.

Cf. A006287, A007013, A375212.

Showing 1-1 of 1 results.