|
Search: id:A145340
|
|
|
| A145340 |
|
a(n) = the maximum of d(p(n)-1) and d(p(n)+1), where d(m) is the number of divisors of m and p(n) is the nth prime. |
|
+0
2
|
|
| 2, 3, 4, 4, 6, 6, 6, 6, 8, 8, 8, 9, 8, 8, 10, 8, 12, 12, 8, 12, 12, 10, 12, 12, 12, 9, 8, 12, 12, 10, 12, 12, 8, 12, 12, 12, 12, 10, 16, 8, 18, 18, 14, 14, 12, 12, 16, 12, 12, 12, 12, 20, 20, 18, 9, 16, 16, 16, 12, 16, 8, 12, 12, 16, 16, 8, 16, 20, 12, 12, 12, 24, 10, 12, 16, 16, 16
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
Table[Max[DivisorSigma[0, Prime[n]-1], DivisorSigma[0, Prime[n]+1]], {n, 1, 100}] [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 11 2008]
|
|
CROSSREFS
|
Cf. A145339, A008328, A008329, A067889, A103664, A103665
Sequence in context: A126012 A096908 A162684 this_sequence A160680 A061984 A063208
Adjacent sequences: A145337 A145338 A145339 this_sequence A145341 A145342 A145343
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Oct 08 2008
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 2008
|
|
|
Search completed in 0.002 seconds
|
