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!)
A017365 a(n) = 10n + 8. 11
8, 18, 28, 38, 48, 58, 68, 78, 88, 98, 108, 118, 128, 138, 148, 158, 168, 178, 188, 198, 208, 218, 228, 238, 248, 258, 268, 278, 288, 298, 308, 318, 328, 338, 348, 358, 368, 378, 388, 398, 408, 418, 428, 438, 448, 458, 468, 478, 488, 498, 508, 518, 528, 538 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, May 29 2011
G.f.: 2*( 4+x ) / (x-1)^2 . - R. J. Mathar, Nov 26 2014
MATHEMATICA
Range[8, 1000, 10] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
LinearRecurrence[{2, -1}, {8, 18}, 60] (* Harvey P. Dale, Aug 31 2015 *)
PROG
(Magma) [10*n+8: n in [0..60]]; // Vincenzo Librandi, May 29 2011
CROSSREFS
2*A016897(n).
Sequence in context: A283611 A043521 A277595 * A352735 A084394 A085248
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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)