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!)
A174803 a(n) = n + ceiling(sqrt(n))*floor(sqrt(n)). 2
0, 2, 4, 5, 8, 11, 12, 13, 14, 18, 22, 23, 24, 25, 26, 27, 32, 37, 38, 39, 40, 41, 42, 43, 44, 50, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 72, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 98, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 128, 137 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = n + A038759(n). - Robert G. Wilson v, Apr 17 2010
a(n^2) = 2*n^2. - Bernard Schott, Jul 30 2022
MATHEMATICA
f[n_]:=n+Floor[Sqrt[n]]*Ceiling[Sqrt[n]]; Table[f[n], {n, 0, 5!}]
CROSSREFS
Cf. A000290 (n^2), A001105 (2*n^2).
Sequence in context: A103075 A294940 A322125 * A282434 A105659 A298990
KEYWORD
nonn,easy
AUTHOR
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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)