login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103893 Number of distinct prime factors of prime(n)! / prime(n)# + 1. 2
1, 1, 1, 1, 2, 3, 3, 4, 2, 3, 2, 4, 4, 5, 3, 2, 3, 4, 6, 5, 5, 5, 5, 6, 5, 4, 5, 3, 7, 5 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

Also the number of distinct prime factors of the P_n-th compositorial.

a(n) = A001221(A103890(n)).

a(31)>4 and its composite part is a 155-digit number.

LINKS

Dario Alejandro Alpern, Factorization using the Elliptic Curve Method

Hisanori Mishimar, Compositorial + 1 (n = 4 to 150)

R. Zumkeller, p(n)!/p(n )#+1

MATHEMATICA

bigomega[n_Integer] := Plus @@ Last /@ FactorInteger[n]; f[n_] := Prime[n]!/Product[Prime[i], {i, n}] + 1; Table[ f[n], {n, 27}] (from Robert G. Wilson v Mar 11 2005)

CROSSREFS

Cf. A103858.

Sequence in context: A177876 A079633 A060573 * A106448 A159909 A176004

Adjacent sequences:  A103890 A103891 A103892 * A103894 A103895 A103896

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 20 2005

EXTENSIONS

Corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:53 EST 2012. Contains 205570 sequences.