Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057109
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057109 Numbers n which are not a factor of P(n)!, where P(n) is the largest prime factor of n. +0
10
4, 8, 9, 12, 16, 18, 24, 25, 27, 32, 36, 45, 48, 49, 50, 54, 64, 72, 75, 80, 81, 90, 96, 98, 100, 108, 121, 125, 128, 135, 144, 147, 150, 160, 162, 169, 175, 180, 189, 192, 196, 200, 216, 224, 225, 240, 242, 243, 245, 250, 256, 270, 288, 289, 294, 300, 320, 324 (list; graph; listen)
OFFSET

1,1

COMMENT

These are also the numbers whose Smarandache function is composite. Their density approaches zero as they go to infinity. - Jud McCranie (j.mccranie(AT)comcast.net), Dec 08 2001

n is a member if and only if P(n) < A002034(n). The members are the exceptions to the rule that P(n) = A002034(n) for almost all n (Erdos and Kastanas 1994, Ivic 2004). - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 10 2005

Same as numbers n such that |e - m/n| < 1/(P(n)+1)! for some integer m. - Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Dec 29 2007

REFERENCES

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 284-292.

P. Erdos and I. Kastanas, Problem/Solution 6674:The smallest factorial that is a multiple of n, Amer. Math. Monthly 101 (1994) 179.

J. Sondow, A geometric proof that e is irrational and a new measure of its irrationality, Amer. Math. Monthly 113 (2006) 637-641.

LINKS

S. R. Finch, The Average Value of the Smarandache Function

C. Rivera, Conjecture about their density

Eric Weisstein's World of Mathematics, Smarandache function

A. Ivic (2004), On a problem of Erdos involving the largest prime factor of n

J. Sondow, A geometric proof that e is irrational and a new measure of its irrationality

EXAMPLE

12 is in the sequence since 3 is the largest prime factor of 12, but 12 is not a factor of 3!=6.

MAPLE

with(numtheory): for n from 2 to 800 do if ifactors(n)[2][nops(ifactors(n)[2])][1]! mod n <> 0 then printf(`%d, `, n) fi; od:

CROSSREFS

Cf. A002034, A006530, A057108.

Sequence in context: A053443 A048098 A122145 this_sequence A069189 A069168 A102211

Adjacent sequences: A057106 A057107 A057108 this_sequence A057110 A057111 A057112

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Aug 08 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 22 2000

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research