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!)
A165775 n + (least square >= n), i.e., n + A048761(n). 3
0, 2, 6, 7, 8, 14, 15, 16, 17, 18, 26, 27, 28, 29, 30, 31, 32, 42, 43, 44, 45, 46, 47, 48, 49, 50, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 146 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
MATHEMATICA
Table[n+Ceiling[Sqrt[n]]^2, {n, 0, 70}] (* Harvey P. Dale, Feb 04 2019 *)
PROG
(PARI) A165775(n)=n+(sqrtint(n-1)+1)^2
CROSSREFS
Sequence in context: A026311 A063291 A088225 * A258826 A157671 A196747
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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 03:28 EDT 2024. Contains 371696 sequences. (Running on oeis4.)