login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317628 Take a number z of x digits and consider any concatenation z = concat(y_1, y_2, ..., y_i) where y_1, y_2, ..., y_i have the same number of digits. Then be g(z) the product of the sums y_1 + y_2 + ... + y_i for all those concatenations. Sequence lists numbers z such that g(g(z)) = z. (See example.) 1
1782, 109000, 208000, 307000, 406000, 505000, 604000, 703000, 802000, 901000, 18802160, 33534424, 67452850, 71272872, 2496688768, 100000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The number of concatenations is d(x)-1, where d(x) is the number of divisors of x (z = concat(z) is excluded).

So far only fixed points of the transform g(z).

For n>1, the numbers equal to 10^(A066230(n)-1) belong to the sequence. - Giovanni Resta, Aug 04 2018

LINKS

Table of n, a(n) for n=1..16.

EXAMPLE

z = 1782, x = 4. The concatenations are (1,7,8,2), (17,82) and g(z) = (1+7+8+2) * (17+82) = 1782.

z = 18802160, x = 8. The concatenations are (1,8,8,0,2,1,6,0), (18,80,21,60), (1880,2160) and g(z) = (1+8+8+0+2+1+6+0)*(18+80+21+60)*(1880+2160) = 18802160.

MAPLE

with(numtheory): T:=proc(w) local i, k, x, y, z; z:=1; i:=sort([op(divisors(ilog10(w)+1))]); for k from 1 to nops(i)-1 do x:=0; y:=w; while y>0 do x:=x+(y mod 10^i[k]); y:=trunc(y/10^i[k]); od; z:=z*x; od; z; end: P:=proc(q) local c, d, j, n; for j from 1 to q do if not isprime(j+1) then for n from 10^j to 10^(j+1)-1 do c:=T(n); if c>0 then d:=T(c); fi; if d=n and d<>c then print(n); fi; od; fi; od; end: P(10^9); # Paolo P. Lava, Aug 02 2018

MATHEMATICA

g[n_] := Block[{d = IntegerDigits[n], nd}, nd = Length@d; Times @@ (Plus @@ FromDigits /@ Partition[d, #] & /@ Most[Divisors@ nd])]; Select[Range[2, 10^6], g[g[#]] == # &] (* Giovanni Resta, Aug 04 2018 *)

CROSSREFS

Cf. A000005, A317593, A066230.

Sequence in context: A251086 A255157 A175693 * A114075 A232315 A013593

Adjacent sequences:  A317625 A317626 A317627 * A317629 A317630 A317631

KEYWORD

nonn,base,more

AUTHOR

Paolo P. Lava, Aug 02 2018

EXTENSIONS

a(12)-a(16) from Giovanni Resta, Aug 02 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 02:48 EDT 2021. Contains 347605 sequences. (Running on oeis4.)