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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165776 n + (least square > n), i.e., n + A048761(n+1). 1
1, 5, 6, 7, 13, 14, 15, 16, 17, 25, 26, 27, 28, 29, 30, 31, 41, 42, 43, 44, 45, 46, 47, 48, 49, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 145, 146 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..65.

FORMULA

a(n) = A001477(n) + A048761(n+1)

EXAMPLE

a(4)= 13 = 4+9 because 9 is the least square > 4.

PROG

(PARI) A165776(n)=n+(sqrtint(n)+1)^2

CROSSREFS

Cf. A165775.

Sequence in context: A247522 A011761 A106745 * A003273 A006991 A047574

Adjacent sequences:  A165773 A165774 A165775 * A165777 A165778 A165779

KEYWORD

easy,nonn

AUTHOR

M. F. Hasler, Oct 05 2009

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified October 1 23:55 EDT 2014. Contains 247527 sequences.