login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 n-th prime. 1
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; refs; listen; history; internal format)
OFFSET

1,1

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 * A160680 A061984 A063208

Adjacent sequences:  A145337 A145338 A145339 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.