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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111743 Numbers n such that the largest prime factor p of n is also the largest prime factor of n.p, where the dot means concatenation. 0

%I

%S 14,24,40,56,101,103,107,109,113,127,129,130,131,134,137,139,141,142,

%T 146,149,151,157,158,159,163,166,167,170,173,177,178,179,181,183,190,

%U 191,193,194,197,199,201,202,206,211,213,214,218,219,223,226,227,229

%N Numbers n such that the largest prime factor p of n is also the largest prime factor of n.p, where the dot means concatenation.

%e 249 = 3*83; 24983 = 7*43*83; both numbers have the same largest prime factor, so 249 is in the sequence.

%o (MuPAD) for n from 2 to 500 do A := ifactor(n); b := A[nops(A)-1]; zi := trunc(log(10,b)+1); nn := n*10^zi+b; B := ifactor(nn); if A[nops(A)-1] = B[nops(B)-1] then print(n, b); end_if; end_for;

%K nonn,base

%O 1,1

%A _Stefan Steinerberger_, Nov 19 2005

%E Edited by _Charles R Greathouse IV_, Apr 29 2010

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.

Last modified November 30 22:31 EST 2021. Contains 349426 sequences. (Running on oeis4.)