Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046427
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A046427
%S A046427 91,128,196,305,344,416,438,456,554,656,690,707,746,750,779,897,910,950,
%T A046427 1014,1060,1098,1122,1199,1209,1247,1380,1507,1545,1606,1679,1680,1700,
%U A046427 1711,1769,1833,1884,1887,1888,1928,1971,1984,2000
%N A046427 7 steps needed to reach a prime under prime factor concatenation procedure.
%H A046427 P. De Geest, <a href="http://www.worldofnumbers.com/topic1.htm">Home 
               Primes</a>
%t A046427 numberSteps[x_]:=Module[{n,steps,digits,i},n=x; steps=0; While[ !PrimeQ[n]&&steps<10,
               factors=FactorInteger[n]; digits={}; For[i=1,i<=Length[factors],i++, 
               digits=Join[digits, Flatten[ Table[IntegerDigits[factors[[i,1]]],
               {factors[[i,2]]}]]];]; n=FromDigits[digits]; steps++;]; Return[steps]]; 
               For[i=1,i<2000,i++,If[numberSteps[i]==7,Print[i];];]; - Sam Handler 
               (sam_5_5_5_0(AT)yahoo.com), Aug 16 2006
%Y A046427 Cf. A037271, A046411.
%Y A046427 Sequence in context: A005935 A020307 A020235 this_sequence A020238 A020301 
               A083517
%Y A046427 Adjacent sequences: A046424 A046425 A046426 this_sequence A046428 A046429 
               A046430
%K A046427 nonn,more
%O A046427 0,1
%A A046427 Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1998.
%E A046427 More terms from Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 16 2006

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research