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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017485 11n+8. 6
8, 19, 30, 41, 52, 63, 74, 85, 96, 107, 118, 129, 140, 151, 162, 173, 184, 195, 206, 217, 228, 239, 250, 261, 272, 283, 294, 305, 316, 327, 338, 349, 360, 371, 382, 393, 404, 415, 426, 437, 448, 459, 470, 481, 492, 503, 514, 525, 536, 547, 558, 569, 580, 591 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

a(n) = A125199(n+1,3) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 24 2006

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=22*n-a(n-1)+5 (with a(0)=8).[From Vincenzo Librandi, Dec 24 2010]

MATHEMATICA

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

PROG

(Other) sage: [i+8 for i in range(475) if gcd(i, 11) == 11] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 21 2009]

CROSSREFS

Cf. A002939, A016789, A017041, A125202.

Sequence in context: A076096 A178130 A144171 * A146270 A146222 A140672

Adjacent sequences:  A017482 A017483 A017484 * A017486 A017487 A017488

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 14 07:40 EST 2012. Contains 205597 sequences.