Search: a023589 -id:a023589
|
| |
|
|
A072055
|
|
a(n) = 2*prime(n)+1.
|
|
+10
24
|
|
|
|
5, 7, 11, 15, 23, 27, 35, 39, 47, 59, 63, 75, 83, 87, 95, 107, 119, 123, 135, 143, 147, 159, 167, 179, 195, 203, 207, 215, 219, 227, 255, 263, 275, 279, 299, 303, 315, 327, 335, 347, 359, 363, 383, 387, 395, 399, 423, 447, 455, 459, 467, 479
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
(Haskell)
|
|
|
CROSSREFS
|
Cf. A000040, A005385, A023589, A023590, A023591, A023592, A023593, A072059, A023595, A072060, A072056, A072057, A072058, A072192, A165286, A278230.
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
| |
|
|
A072059
|
|
Smallest prime p such that 2*p+1 has n distinct prime factors.
|
|
+10
2
|
|
|
|
2, 7, 97, 577, 7507, 217717, 5232727, 75172597, 1617423307, 59844662377, 2750790860317, 109455887488447, 4621264673452927, 218071376383127767, 10914293640945722527, 662082573402158125717, 41249727342503299116997
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Note that for each n=1,...,8, the product of the smallest n-1 distinct prime factors of 2*a(n)+1 is p(n)#/2, where p(n)# is the primorial (A002110) of the n-th prime - and the n-th distinct prime factor >= p(n+1). - Rick L. Shepherd, Jul 06 2002
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
a(4)=577=A000040(106): 2*577+1 = 1155 = 11*7*5*3, 4 distinct factors.
|
|
|
PROG
|
(PARI) for (n=1, 8, p=1; until(isprime(p) && omega(2*p+1)==n, p++); print1(p, ", "))
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
| |
|
|
A023516
|
|
Number of distinct prime divisors of prime(n)*prime(n-1) - 1.
|
|
+10
1
|
|
|
|
0, 1, 2, 2, 2, 2, 3, 3, 2, 3, 2, 3, 2, 2, 3, 4, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 4, 3, 2, 4, 2, 3, 2, 4, 3, 3, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 2, 3, 3, 4, 4, 4, 4, 4, 3, 4, 2, 3, 4, 2, 4, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
MAPLE
|
0, seq(nops(numtheory:-factorset(ithprime(n)*ithprime(n-1)-1)), n=2..120); # Muniru A Asiru, Apr 29 2019
|
|
|
MATHEMATICA
|
Prepend[Table[PrimeNu[Prime[n] Prime[n-1] - 1], {n, 2, 80}], 0] (* Vincenzo Librandi, Apr 27 2019 *)
|
|
|
PROG
|
(Magma) [#PrimeDivisors(NthPrime(n)*(NthPrime(n-1))-1): n in [1..100]]; // Vincenzo Librandi, Apr 27 2019
(PARI) a(n) = if (n==1, 0, omega(prime(n)*prime(n-1) - 1)); \\ Michel Marcus, Apr 30 2019
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
Search completed in 0.008 seconds
|
