This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137935 a(n) = 5n + 26*floor(n/5). 1
 0, 5, 10, 15, 20, 51, 56, 61, 66, 71, 102, 107, 112, 117, 122, 153, 158, 163, 168, 173, 204, 209, 214, 219, 224, 255, 260, 265, 270, 275, 306, 311, 316, 321, 326, 357, 362, 367, 372, 377, 408, 413, 418, 423, 428, 459, 464, 469, 474, 479, 510, 515, 520, 525, 530, 561, 566 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Robert Israel, Table of n, a(n) for n = 0..10000 Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,1,-1). FORMULA a(n) = 5n + 26*floor(n/5) = 5n + 26*A002266(n) G.f.: (5*x+5*x^2+5*x^3+5*x^4+31*x^5)/(1-x-x^5+x^6). - Robert Israel, Apr 02 2017 EXAMPLE a(0) = 5(0) + 26*floor(0/5) = 0 a(3) = 5(3) + 26*floor(3/5) = 15 MAPLE seq(5*n + 26*floor(n/5), n=0..200); # Robert Israel, Apr 02 2017 PROG (Python) a = lambda n: 5*n + 26*floor(n/5) CROSSREFS Cf. A002266. Sequence in context: A115817 A070004 A104356 * A255400 A115182 A313762 Adjacent sequences:  A137932 A137933 A137934 * A137936 A137937 A137938 KEYWORD nonn,easy AUTHOR William A. Tedeschi, Mar 06 2008 STATUS approved

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

Last modified February 21 23:44 EST 2019. Contains 320381 sequences. (Running on oeis4.)