|
|
0, 25, 50, 75, 100, 125, 150, 175, 200, 225, 250, 275, 300, 325, 350, 375, 400, 425, 450, 475, 500, 525, 550, 575, 600, 625, 650, 675, 700, 725, 750, 775, 800, 825, 850, 875, 900, 925, 950, 975, 1000, 1025, 1050, 1075, 1100, 1125, 1150, 1175, 1200, 1225
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 337
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081, 2014
Index entries for linear recurrences with constant coefficients, signature (2, -1).
|
|
|
FORMULA
|
G.f.: 25*x/(1-x)^2. - Colin Barker, Feb 19 2012
|
|
|
MATHEMATICA
|
Range[0, 1500, 25] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)
|
|
|
PROG
|
(PARI) a(n)=25*n \\ Charles R Greathouse IV, Oct 07 2015
|
|
|
CROSSREFS
|
Cf. A008605, A008606.
Sequence in context: A085625 A116490 A230213 * A044077 A043350 A023723
Adjacent sequences: A008604 A008605 A008606 * A008608 A008609 A008610
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
STATUS
|
approved
|
|
