|
%I #35 Sep 08 2022 08:46:21
%S 0,1,5,6,7,11,19,79,84,111,123,176,232,396,1111,11111,111111,331788,
%T 1111111,11111111,111111111,1111111111,11111111111,111111111111,
%U 1111111111111,11111111111111,111111111111111
%N Numbers k such that the number m multiplied by the product of all its digits contains k as a substring, where m = k multiplied by the product of all its digits.
%C Inspired by A328095. Like A328095 this sequence contains all the repunits. These numbers could be called 'Two-step Revenant numbers'. It is unknown if 331788 is the last non-repunit.
%H Eric Angelini, <a href="http://cinquantesignes.blogspot.com/2019/10/revenant-numbers.html">Revenant Numbers</a>, Cinquante Signes, Oct 19 2019.
%e 79 is in the sequence as m = 79*7*9 = 4977, and 4977*4*9*7*7 = 8779428, and '8779428' contains '79' as a substring.
%e 331788 is in the sequence as m = 331788*3*3*1*7*8*8 = 1337769216, and 1337769216*1*3*3*7*7*6*9*2*1*6 = 382291633317888, and '382291633317888' contains '331788' as a substring.
%t f[n_] := n * Times @@ IntegerDigits[n]; aQ[n_] := SequenceCount[IntegerDigits[ f[f[n]] ], IntegerDigits[n]] > 0; Select[Range[0, 10^6], aQ] (* _Amiram Eldar_, Nov 10 2019 *)
%o (Magma) a:=[0]; f:=func<n|n*(&*Intseq(n))>; for k in [1..1200000] do t:=IntegerToString(f(f(k))); s:=IntegerToString(k); if s in t then Append(~a,k); end if; end for; a; // _Marius A. Burtea_, Nov 10 2019
%Y Cf. A328095, A326806, A328544.
%K nonn,base,more
%O 1,3
%A _Scott R. Shannon_, Nov 10 2019
%E a(24)-a(27) from _Giovanni Resta_, Nov 15 2019
|
