login
The OEIS is supported by the many generous donors 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

%I #5 Mar 11 2014 01:34:15

%S 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,

%T 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,

%U 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

%N 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.

%C Se also A162340.

%H Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/polmpfpn.jpg">Graph of the mountain path function for prime numbers</a>

%F a(n) = A052288(n-2) + (-1)^n for n>=3. [From _Nathaniel Johnston_, Nov 06 2010]

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

%K nonn

%O 0,3

%A _Omar E. Pol_, Jul 01 2009

%E Edited by _Omar E. Pol_, Jul 05 2009

%E More terms from _Nathaniel Johnston_, Nov 06 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)