login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056237 a(n) = 2*n^2 + 9*n - 5. 0
6, 21, 40, 63, 90, 121, 156, 195, 238, 285, 336, 391, 450, 513, 580, 651, 726, 805, 888, 975, 1066, 1161, 1260, 1363, 1470, 1581, 1696, 1815, 1938, 2065, 2196, 2331, 2470, 2613, 2760, 2911, 3066, 3225, 3388, 3555, 3726, 3901, 4080, 4263, 4450, 4641, 4836, 5035 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

Michael Serra, Discovering geometry: an inductive approach, 2nd ed., Berkeley, Calif.: Key Curriculum Press, 1997, p. 61, Problem 8.

LINKS

Table of n, a(n) for n=1..48.

Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

MATHEMATICA

Table[2n^2+9n-5, {n, 50}] (* Harvey P. Dale, May 30 2021 *)

CROSSREFS

Sequence in context: A031094 A007339 A225150 * A199194 A268223 A048036

Adjacent sequences: A056234 A056235 A056236 * A056238 A056239 A056240

KEYWORD

nonn,easy,less

AUTHOR

Pam Smith (homelizard(AT)aol.com), Aug 20 2000

EXTENSIONS

Name clarified by Editors of OEIS, May 24 2021

More terms from Harvey P. Dale, May 30 2021

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 December 2 13:44 EST 2022. Contains 358510 sequences. (Running on oeis4.)