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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179805 a(0) = 1, a(1) = 3, a(2) = 6; a(n), n>2 = 2*a(n-1) - a(n-2). a(n), n>2 = a(n-1) + 9. 1
1, 3, 6, 15, 24, 33, 42, 51, 60, 69, 78, 87, 96, 105, 114, 123, 132, 141, 150, 159, 168, 177, 186, 195, 204, 213, 222, 231, 240, 249, 258, 267, 276, 285, 294, 303, 312, 321, 330, 339, 348, 357, 366, 375, 384, 393, 402 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

For n> 1, a(n) == 6 mod 9.

Apart from the second term, the same as A122709. [From R. J. Mathar, Jul 30 2010]

LINKS

Table of n, a(n) for n=0..46.

Index entries for linear recurrences with constant coefficients, signature (2,-1).

FORMULA

(1 + 3x + 6x^2 + 15x^3 + ...) = (1 + 3x^2 + 3x^3 + 3x^4 + ...) *

(1 + 3x + 3x^2 + 3x^3 + 3x^4 + ...).

a(0) = 1, a(1) = 3, a(2) = 6; a(n), n>2 = 2*a(n-1) - a(n-2).

a(n), n>2 = a(n-1) + 9.

a(n) = 9*n-12 for n>1. G.f.: (2*x+1)*(3*x^2-x+1)/(x-1)^2. [Colin Barker, Oct 28 2012]

EXAMPLE

a(4) = 24 = 9 + a(3) = 9 + 15.

a(4) = 24 = 2*a(3) - a(2) = 2*15 - 6.

CROSSREFS

Sequence in context: A244164 A129602 A044888 * A006639 A242757 A166448

Adjacent sequences:  A179802 A179803 A179804 * A179806 A179807 A179808

KEYWORD

nonn,easy

AUTHOR

Gary W. Adamson, Jul 27 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 22 09:44 EDT 2017. Contains 292337 sequences.