|
Search: id:A061117
|
|
|
| A061117 |
|
Compute number of divisors of the p(n+1)-p(n)-1 composite numbers between two consecutive primes; choose the largest. |
|
+0
3
|
|
| 3, 4, 4, 6, 5, 6, 6, 8, 8, 9, 8, 8, 6, 10, 8, 12, 8, 8, 12, 8, 10, 12, 12, 9, 8, 8, 12, 10, 16, 8, 12, 8, 15, 12, 12, 12, 8, 16, 10, 18, 8, 14, 9, 12, 16, 16, 12, 12, 8, 12, 20, 8, 18, 12, 16, 16, 12, 16, 8, 18, 18, 12, 16, 12, 16, 20, 12, 12, 12, 8, 24, 12, 16, 12, 16, 18, 15, 16, 12
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
a(n)=Max{d(c); p(n+1)>c>p(n)}, c is composite, p(n) is the n-th prime and d=A000005()
|
|
EXAMPLE
|
p(30)=113 is followed by 13 composites; numbers of divisors are {8, 4, 6, 6, 4, 4, 16, 3, 4, 4, 6, 4, 12}, The smallest is 4=a(30) and the largest is 16.
|
|
PROGRAM
|
(PARI) { n=-1; q=3; forprime (p=5, prime(1003), a=0; for (i=q + 1, p - 1, a=max(numdiv(i), a)); q=p; write("b061117.txt", n++, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 18 2009]
|
|
CROSSREFS
|
Cf. A000005, A061112.
Sequence in context: A051665 A028263 A059179 this_sequence A111234 A014683 A166737
Adjacent sequences: A061114 A061115 A061116 this_sequence A061118 A061119 A061120
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), May 29 2001
|
|
|
Search completed in 0.002 seconds
|
