|
Search: id:A080373
|
|
|
| A080373 |
|
a(n) is the smallest number such that GCD of n values of p(j)-1 for successive j values is greater than 2, where p(j)=j-th prime. |
|
+0
1
|
|
| 0, 6, 24, 77, 271, 271, 1395, 1395, 1395, 13717, 34369, 172146, 172146, 804584, 804584, 804584
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)=Min{x; GCD[p(x)-1, ..., p(x+n-1)]>2}, where p()=A000040().
|
|
EXAMPLE
|
n=2: a(n)=6=A067605(2); n=3: a(3)=24 means: firstly occurs that for three consecutive p-1 terms GCD[p(24)-1, p(25)-1, p(26)-1]= GCD[88, 96, 100]=4>2;
|
|
CROSSREFS
|
Cf. A058263, A067605.
Sequence in context: A006528 A052749 A090574 this_sequence A058809 A140088 A011855
Adjacent sequences: A080370 A080371 A080372 this_sequence A080374 A080375 A080376
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Feb 26 2003
|
|
|
Search completed in 0.002 seconds
|
