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!)
A053742 Sum of odd numbers in range 10*n to 10*n+9. 16
25, 75, 125, 175, 225, 275, 325, 375, 425, 475, 525, 575, 625, 675, 725, 775, 825, 875, 925, 975, 1025, 1075, 1125, 1175, 1225, 1275, 1325, 1375, 1425, 1475, 1525, 1575, 1625, 1675, 1725, 1775, 1825, 1875, 1925, 1975, 2025, 2075, 2125, 2175, 2225, 2275 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Integers that are the product of two integers ending with 5. - Michel Marcus, Mar 16 2019
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
a(n) = 25 + 50*n.
a(n) = a(n-1) + 50. - Harvey P. Dale, Aug 11 2011
From Colin Barker, Jun 27 2012: (Start)
a(n) = 2*a(n-1) - a(n-2).
G.f.: 25*(1+x)/(1-x)^2. (End)
E.g.f.: 25*(1+2*x)*exp(x). - G. C. Greubel, Sep 06 2019
EXAMPLE
25 = 1+3+5+7+9; 75 = 11+13+15+17+19; ...
MAPLE
seq(25*(2*n+1), n=0..50); # G. C. Greubel, Sep 06 2019
MATHEMATICA
Range[25, 2275, 50] (* or *) NestList[#+50&, 25, 50] (* Harvey P. Dale, Aug 11 2011 *)
PROG
(Magma) [25+50*n: n in [0..50]]; // Vincenzo Librandi, Aug 12 2011
(PARI) a(n)=50*n+25 \\ Charles R Greathouse IV, Aug 25 2014
(Sage) [25*(2*n+1) for n in (0..50)] # G. C. Greubel, Sep 06 2019
(GAP) List([0..50], n-> 25*(2*n+1)); # G. C. Greubel, Sep 06 2019
CROSSREFS
Sequence in context: A044544 A045180 A270385 * A123296 A118610 A008852
KEYWORD
nonn,easy
AUTHOR
Odimar Fabeny, Feb 13 2000
EXTENSIONS
More terms from James A. Sellers, Feb 22 2000
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 March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)