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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025579 a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3. 4
1, 2, 4, 12, 36, 108, 324, 972, 2916, 8748, 26244, 78732, 236196, 708588, 2125764, 6377292, 19131876, 57395628, 172186884, 516560652, 1549681956, 4649045868, 13947137604, 41841412812, 125524238436, 376572715308, 1129718145924 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = sum of the numbers in row n+1 of the array defined in A025564 (and of the array in A024996).

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3.

Equals binomial transform of A095342: (1, 1, 5, 5, 17, 25, 61,...). - Gary W. Adamson, Mar 04 2010

LINKS

Table of n, a(n) for n=1..27.

Index entries for linear recurrences with constant coefficients, signature (3).

FORMULA

a(n)=A003946(n-2), n>2. - R. J. Mathar, May 28 2008

MATHEMATICA

Join[{1, 2}, 4*3^Range[0, 30]] (* or *) Join[{1, 2}, NestList[3#&, 4, 30]] (* Harvey P. Dale, Jun 27 2011 *)

PROG

(PARI) a(n)=max(n, 4*3^(n-3)) \\ Charles R Greathouse IV, Jun 28 2011

CROSSREFS

Cf. A095342. - Gary W. Adamson, Mar 04 2010

Sequence in context: A149839 A149840 A224540 * A214936 A010552 A149841

Adjacent sequences:  A025576 A025577 A025578 * A025580 A025581 A025582

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

EXTENSIONS

Definition corrected by R. J. Mathar, May 28 2008

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 May 22 13:18 EDT 2017. Contains 286872 sequences.