This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017233 9*n+6. 5

%I

%S 6,15,24,33,42,51,60,69,78,87,96,105,114,123,132,141,150,159,168,177,

%T 186,195,204,213,222,231,240,249,258,267,276,285,294,303,312,321,330,

%U 339,348,357,366,375,384,393,402,411,420,429,438,447,456,465,474,483

%N 9*n+6.

%C General form: (q*n-1)*q, cf. A017233 (q=3), A098502 (q=4). [From Vladimir Orlovsky, Feb 16 2009]

%H Vincenzo Librandi, <a href="/A017233/b017233.txt">Table of n, a(n) for n = 0..5000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rea#recLCC">Index to sequences with linear recurrences with constant coefficients</a>, signature (2,-1).

%t Range[6, 1000, 9] (* From Vladimir Joseph Stephan Orlovsky, May 28 2011 *)

%o (MAGMA) [9*n+6: n in [0..60]]; // Vincenzo Librandi, Jul 24 2011

%Y Cf. A008591, A017209, A017221.

%K nonn,easy

%O 0,1

%A David J. Horn and Laura Krebs Gordon (lkg615(AT)verizon.net), 1985

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 .