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!)
A135989 a(n) = 6*n + 3 + 90*floor((6*n+3)/10). 0
3, 9, 105, 201, 207, 303, 309, 405, 501, 507, 603, 609, 705, 801, 807, 903, 909, 1005, 1101, 1107, 1203, 1209, 1305, 1401, 1407, 1503, 1509, 1605, 1701, 1707, 1803, 1809, 1905, 2001, 2007, 2103, 2109, 2205, 2301, 2307, 2403, 2409, 2505, 2601, 2607, 2703 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
All terms are divisible by 3.
LINKS
FORMULA
a(n) = a(n-1)+a(n-5)-a(n-6). - Colin Barker, Feb 02 2013
G.f.: 3*(31*x^5 +2*x^4 +32*x^3 +32*x^2 +2*x +1) / ((x -1)^2*(x^4 +x^3 +x^2 +x +1)). - Colin Barker, Feb 02 2013
CROSSREFS
Sequence in context: A245646 A018716 A018725 * A227772 A125652 A232701
KEYWORD
nonn,easy
AUTHOR
Stefano Maruelli and Paola Paoloni (robotec(AT)netsurf.it), Mar 02 2008
EXTENSIONS
Edited by Charles R Greathouse IV, Nov 03 2009
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 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)