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!)
A324798 a(n) = floor(sqrt(2)*prime(n)) - prime(n+1). 1

%I #7 Nov 23 2023 12:55:04

%S -1,-1,0,-2,2,1,5,3,3,10,6,11,14,13,13,15,22,19,23,27,24,28,28,28,36,

%T 39,38,42,41,32,48,48,54,47,59,56,59,63,63,65,72,64,77,75,79,70,75,88,

%U 92,90,90,96,89,97,100,102,109,106,110,114,107,107,123,126,125,117,131,129,141,140,140,140,146,148,152,152

%N a(n) = floor(sqrt(2)*prime(n)) - prime(n+1).

%C Theorem: a(n) > 0 for all n > 4.

%D D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, 1996, Section VII.18, p. 247.

%t Floor[Sqrt[2]#[[1]]]-#[[2]]&/@Partition[Prime[Range[80]],2,1] (* _Harvey P. Dale_, Nov 23 2023 *)

%Y Cf. A064051.

%K sign

%O 1,4

%A _N. J. A. Sloane_, Sep 11 2019

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 24 19:31 EDT 2024. Contains 371962 sequences. (Running on oeis4.)