Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063684
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063684 Numbers n such that m(n!) = 2, where m(n) = mu(n) + mu(n+1) + mu(n+2). +0
1
8, 13, 14, 18, 19, 20, 25, 36, 38, 43, 48, 51, 52, 54, 60, 71, 74, 75 (list; graph; listen)
OFFSET

1,1

COMMENT

Equivalently, n such that m(n!) = 2, where m(n) = mu(n+1) + mu(n+2), as mu(n!)=0 for all n>=4 (because 4=2^2 divides n!). 87, 91, and 92 are also terms. The only other possible terms with n <= 100 depend upon the factorizations of n!+2 for n=78, 80, 89, 95, 97 and 98. - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 20 2003

LINKS

Dario A. Alpern, Factorization using the Elliptic Curve Method.

Paul Leyland, Factors of n!+1.

EXAMPLE

8! = 40320, mu(40320) = 0, mu(40321) = 1, mu(40322) = 1, which gives 2.

PROGRAM

(PARI) m(n) = moebius(n)+moebius(n+1)+moebius(n+2); for(n=1, 10^4, if(m(n!)==2, print(n)))

CROSSREFS

Cf. A063838, A008683.

Cf. A084846 (mu(n!+1)).

Adjacent sequences: A063681 A063682 A063683 this_sequence A063685 A063686 A063687

Sequence in context: A124159 A128662 A133192 this_sequence A059194 A080361 A054295

KEYWORD

more,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 22 2001

EXTENSIONS

More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 20 2003

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research