%I A056938
%S A056938 49,77,711,3379,31109,132393,344131,1731653,71143523,11115771019,
%T A056938 31135742029,717261644891,11193431873899,116134799345907,
%U A056938 3204751189066719,31068250396355573,62161149980213343
%N A056938 Concatenate all the prime divisors in previous term, starting at 49.
%C A056938 This is the search for the home prime for 49.
%C A056938 This sequence has now been followed for 100 steps without a prime being 
               reached (after which of course it would simply repeat).
%H A056938 N. J. A. Sloane, <a href="b056938.txt">Table of n, a(n) for n = 1..100</
               a> [taken from Patrick De Geest's web page]
%H A056938 P. De Geest, <a href="http://www.worldofnumbers.com/topic1.htm">Home 
               Primes</a>
%H A056938 N. J. A. Sloane, <a href="a056938.txt">Factorization of a(n) for n = 
               1..100</a> [taken from Patrick De Geest's web page]
%H A056938 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               HomePrime.html">Home Prime</a>
%t A056938 g[n_] := (x = n; d = {}; While[FactorInteger[x] != {}, f = FactorInteger[x, 
               FactorComplete -> True][[1, 1]]; x = x/f; AppendTo[d, IntegerDigits[f]]]; 
               FromDigits[Flatten[d]]); NestList[g, 49, 25]
%o A056938 (PARI) a=vector(35); a[1]=49; for(k=2,length(a), f=factor(a[k-1]); for(i=1,
               matsize(f)[1], l=10^ceil(log(f[i,1])/log(10)); for(j=1,f[i,2], a[k]=a[k]*l+f[i,
               1]))) - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Mar 09 2007
%Y A056938 Cf. A006919, A037273, A037274, A037271.
%Y A056938 Sequence in context: A063163 A103216 A036307 this_sequence A106311 A006832 
               A093894
%Y A056938 Adjacent sequences: A056935 A056936 A056937 this_sequence A056939 A056940 
               A056941
%K A056938 nonn,base
%O A056938 1,1
%A A056938 Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 05 2000