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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000277 3*n - 2*floor(sqrt(4*n+5)) + 5. 1
1, 2, 5, 6, 9, 10, 13, 16, 17, 20, 23, 24, 27, 30, 33, 34, 37, 40, 43, 44, 47, 50, 53, 56, 57, 60, 63, 66, 69, 70, 73, 76, 79, 82, 85, 86, 89, 92, 95, 98, 101, 102, 105, 108, 111, 114, 117, 120, 121, 124, 127, 130, 133, 136, 139, 140, 143, 146, 149, 152, 155 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

T. D. Noe, Table of n, a(n) for n = 0..1000

MATHEMATICA

Table[3*n - 2*Floor[Sqrt[4 n + 5]] + 5, {n, 0, 100}] (* T. D. Noe, Jun 19 2012 *)

PROG

(PARI) a(n)=3*n-2*sqrtint(4*n+5)+5

CROSSREFS

Sequence in context: A276883 A288552 A187583 * A003664 A065890 A162177

Adjacent sequences:  A000274 A000275 A000276 * A000278 A000279 A000280

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, based on a message from Michael S. Cann Jr. (mscannjr(AT)gmail.com)

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 21:46 EST 2017. Contains 295141 sequences.