|
%I #12 Dec 17 2015 03:25:57
%S 2,3,5,6,7,10,11,13,14,15,17,19,20,21,22,23,26,28,29,30,31,33,34,35,
%T 37,38,39,40,41,42,43,44,46,47,51,52,53,55,56,57,58,59,60,61,62,63,65,
%U 66,67,68,69,70,71,73,74,76,77,78,79,82,83,84,85,86,87,88,89,91,92,93,94
%N Numbers n dividing P(n)!, where P(n) is the largest prime factor of n.
%C Solutions to Diophantine equation P(n)=K(n), where P(n) is the largest prime which divides n and K(n) is the Kempner function A002034.
%D P. Erdős, C. Ashbacher, Thoughts of Pal Erdos on Some Smarandache Notions, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997, 220-224.
%F a(n) ~ n. - _Charles R Greathouse IV_, Sep 20 2012
%o (PARI) is(n)=my(s=factor(n)[, 1]); s[#s]!%n==0 \\ _Charles R Greathouse IV_, Sep 20 2012
%Y Complement is A057109.
%K nonn,easy
%O 1,1
%A Charles T. Le (charlestle(AT)yahoo.com)
%E Corrected and extended by _Naohiro Nomoto_, Jul 14 2001
|
