OFFSET
1,1
COMMENTS
If n is an odd-digit decimal number, the first half is one digit smaller than the second half. For example, 43614 is in the sequence, because 43*614 = 26402, 26*402 = 10452, 10*452 = 4520, 4*520 = 2080, 2*80 = 160. Here the iteration stops because 160 has three digits, so the first half of the next multiplication is zero. 43614 = 26402 + 10452 + 4520 + 2080 + 160.
If n is an even-digit decimal number, the first half and the second half have the same length. For example, 868688 is in the sequence because 868*688 = 597184, 597*184 = 109848, 109*848 = 92432, 92*432 = 39744, 39*744 = 29016, 29*16 = 464, and here the iteration stops. 868688 = 597184 + 109848 + 92432 + 39744 + 29016 + 464.
If n is in the sequence and has an even number of digits, then 10*n is also in the sequence. - Jon E. Schoenfield, Nov 07 2015
EXAMPLE
86 is in the sequence because 8*6 = 48, 4*8 = 32 and 3*2 = 6. And 86 = 48 + 32 + 6.
MATHEMATICA
fQ[n_] := Block[{i = Ceiling[IntegerLength[n]/2], g}, g[x_] := If[IntegerLength@ x <= i, x, Times @@ (FromDigits /@ {If[IntegerLength@ x - i == 0, Nothing, Take[IntegerDigits@ x, IntegerLength@ x - i]], Take[IntegerDigits@ x, -i]})]; Total@ Rest@ Most@ FixedPointList[g, n] == n]; Select[Range@ 500000, fQ] (* Michael De Vlieger, Nov 06 2015 *)
PROG
(Python)
def pod(n, m):
kk = 1
while n > 0:
kk= kk*(n%m)
n =int(n//m)
return kk
for b in range(0, 6):
dd, bb=0, (b-1)//2+2
j=10**bb
for c in range (10*j, 100*j):
d, a, ca=0, 0, pod(c, j)
while ca>0:
d, a=d+ca, a+1
if ca<j:
ca=j
ca=pod(ca, j)
if c==d and ca==0:
print (a, c)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Pieter Post, Nov 06 2015
EXTENSIONS
a(21)-a(31) from Jon E. Schoenfield, Nov 07 2015
Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019
STATUS
approved