|
Search: id:A060255
|
|
|
| A060255 |
|
Smaller of twin primes {p,p+2} such that the middle term p+1 = kq is the least multiple of the n-th primorial number q. |
|
+0
2
|
|
| 3, 11, 29, 419, 2309, 180179, 4084079, 106696589, 892371479, 103515091679, 4412330782859, 29682952539239, 22514519501013539, 313986271960080719, 22750921955774182169, 912496437361321252439, 26918644902158976946979
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
a(n)=p=k(n)*q(n)-1, where q(n)=A002110(n) and k(n)=A060256(n) is the smallest integer if by which the n-th primorial was multiplied then just these lesser twin primes were obtained.
|
|
EXAMPLE
|
a(13)=-1+(2.3.5.7.....41)*k(13)=304250263527210*74 and {22514519501013539, 22514519501013542} are the corresponding primes, k(13)=74 is the smallest suitable multiplier. Twin primes obtained from primorial numbers with k=1 multiplier seems to be much rarer (see A057706).
For j=1,2,3,4,5,6, a(j)=A001359(1), A059960(1), A060229(1), A060230(1), A060231(1), A060232(1) respectively.
|
|
CROSSREFS
|
Cf. A001359, A002110, A006794, A014545, A057706, A059960, A060229-A060232.
Sequence in context: A110954 A000251 A122023 this_sequence A009183 A106397 A098150
Adjacent sequences: A060252 A060253 A060254 this_sequence A060256 A060257 A060258
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Mar 22 2001
|
|
|
Search completed in 0.002 seconds
|
