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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277050 a(n) = floor(2*n/sqrt(Pi)). 2
0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Paulo Romero Zanconato Pinto, Table of n, a(n) for n = 0..10000

Index entries for sequences related to Beatty sequences

FORMULA

a(n) = floor(2*n/sqrt(Pi)).

MAPLE

A277050:=n->floor(2*n/sqrt(Pi)): seq(A277050(n), n=0..100); # Wesley Ivan Hurt, Sep 26 2016

MATHEMATICA

Table[Floor[2 * n/Sqrt[Pi]], {n, 100}]

PROG

(PARI) a(n) = floor(2*n/sqrt(Pi));

CROSSREFS

Cf. A037086, A190732, A277052 (complement).

Sequence in context: A052421 A248375 A037477 * A013937 A118065 A020661

Adjacent sequences:  A277047 A277048 A277049 * A277051 A277052 A277053

KEYWORD

nonn,easy

AUTHOR

Paulo Romero Zanconato Pinto, Sep 26 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 04:53 EST 2018. Contains 318090 sequences. (Running on oeis4.)