login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017137 8n+6. 11
6, 14, 22, 30, 38, 46, 54, 62, 70, 78, 86, 94, 102, 110, 118, 126, 134, 142, 150, 158, 166, 174, 182, 190, 198, 206, 214, 222, 230, 238, 246, 254, 262, 270, 278, 286, 294, 302, 310, 318, 326, 334, 342, 350, 358, 366, 374, 382, 390, 398, 406, 414, 422, 430 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

a(n) = 2*A004767(n) = A000290(A017245(n)) - A156676(n+1). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 13 2010]

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 2*a(n-1) - a(n-2). [From Vincenzo Librandi, Jun 07 2011]

MATHEMATICA

Range[6, 1000, 8] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 27 2011 *)

PROG

(MAGMA) [8*n+6: n in [0..60]]; // Vincenzo Librandi, Jun 07 2011

CROSSREFS

Cf. A008590, A017101, A017113, A004770.

Sequence in context: A079299 A043445 A189785 * A190522 A079797 A093380

Adjacent sequences:  A017134 A017135 A017136 * A017138 A017139 A017140

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 22:36 EST 2012. Contains 205567 sequences.