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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005053 Expand (1-2x)/(1-5x). 7
1, 3, 15, 75, 375, 1875, 9375, 46875, 234375, 1171875, 5859375, 29296875, 146484375, 732421875, 3662109375, 18310546875, 91552734375, 457763671875, 2288818359375, 11444091796875, 57220458984375 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

a(n) is the number of generalized compositions of n when there are 2^(i+1) different types of i, (i=1,2,...). [From Milan R. Janjic (agnus(AT)blic.net), Sep 24 2010]

a(n) is the number of generalized compositions of n when there are 3*2^(i-1) different types of i, (i=1,2,...). [From Milan R. Janjic (agnus(AT)blic.net), Sep 24 2010]

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 883

FORMULA

Binomial transform of A122117 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 19 2006

a(0)=1, a(n)=3*5^(n-1) for n>=1 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 19 2006

MAPLE

with(finance):seq(ceil(futurevalue(3, 4, n)), n=-1..19); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 25 2009]

MATHEMATICA

CoefficientList[Series[(1-2x)/(1-5x), {x, 0, 30}], x] (* or *) Join[{1}, NestList[5#&, 3, 29]]  (* From Harvey P. Dale, Apr 25 2011 *)

PROG

(MAGMA) [ n eq 0 select 1 else 3*5^(n-1): n in [0..20] ];

CROSSREFS

Sequence in context: A151326 A063000 A002902 * A183411 A136778 A000266

Adjacent sequences:  A005050 A005051 A005052 * A005054 A005055 A005056

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Wrong formula deleted and MAGMA program added by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 04 2010

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 15 17:13 EST 2012. Contains 205828 sequences.