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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162341 a(n) = number of grid points P(x,y) that are covered by a polyedge as the graph of the "mountain path" function for prime numbers, where x=n and y=0..oo. 11
1, 1, 3, 1, 4, 2, 4, 2, 4, 4, 5, 3, 6, 2, 4, 4, 7, 3, 5, 4, 4, 3, 6, 4, 8, 5, 4, 2, 4, 2, 10, 8, 6, 3, 7, 5, 5, 5, 6, 4, 7, 3, 7, 5, 4, 2, 8, 11, 9, 2, 4, 4, 5, 5, 9, 5, 7, 3, 5, 4, 4, 5, 13, 8, 4, 2, 10, 9, 9, 5, 4, 4, 8, 6, 7, 4, 6, 6, 7, 5, 10, 5, 7, 5, 5, 4, 6, 6, 7, 2, 4, 7, 11, 5, 7, 5, 6, 8, 8, 9, 13, 7, 9 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Se also A162340.

LINKS

O. E. Pol, Graph of the mountain path function for prime numbers

FORMULA

a(n) = A052288(n-2) + (-1)^n for n>=3. [From Nathaniel Johnston (nathaniel(AT)nathanieljohnston.com), Nov 06 2010]

CROSSREFS

Cf. A000040, A006005, A008578, A162200, A162201, A162202, A162203, A162340.

Sequence in context: A048225 A155481 A075148 * A066728 A066899 A139432

Adjacent sequences:  A162338 A162339 A162340 * A162342 A162343 A162344

KEYWORD

nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Jul 01 2009

EXTENSIONS

Edited by Omar E. Pol (info(AT)polprimos.com), Jul 05 2009

More terms from Nathaniel Johnston (nathaniel(AT)nathanieljohnston.com), Nov 06 2010

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 16 21:51 EST 2012. Contains 205978 sequences.