Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003464
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003464 (6^n - 1)/5.
(Formerly M4425)
+0
20
1, 7, 43, 259, 1555, 9331, 55987, 335923, 2015539, 12093235, 72559411, 435356467, 2612138803, 15672832819, 94036996915, 564221981491, 3385331888947, 20311991333683, 121871948002099, 731231688012595, 4387390128075571 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = A125118(n,5) for n>4. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 21 2006

a(n)=6*a(n-1)+1 (with a(1)=1) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 29 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

C. Banderier and D. Merlini, Lattice paths with an infinite set of jumps, FPSAC02, Melbourne, 2002.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 375

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

Binomial transform of A003948. If preceded by 0, then binomial transform of powers of 5, A000351 (preceded by 0). - Paul Barry (pbarry(AT)wit.ie), Mar 28 2003

a(n)=Sum{k=1..n, C(n, k)5^(k-1) }. E.g.f.: (exp(6x) - exp(x))/5 (offset 0). - Paul Barry (pbarry(AT)wit.ie), Mar 28 2003

G.f.: 1/((1-1x)(1-6x)) - Lambert Klasen (lambert.klasen(AT)gmx.net), Feb 06 2005

MAPLE

a:=n->sum(6^(n-j), j=1..n): seq(a(n), n=1..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 04 2007

A003464:=1/(6*z-1)/(z-1); [Conjectured by S. Plouffe in his 1992 dissertation.]

a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=5*a[n-1]+6*a[n-2]+2 od: seq(a[n], n=1..33); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 14 2008]

MATHEMATICA

lst={}; Do[p=(6^n-1)/5; AppendTo[lst, p], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 29 2008]

PROGRAM

(PARI) for(n=0, 10, print1(polcoeff(1/((1-1*x)*(1-6*x)), n), ", ")) for(n=1, 10, print1((6^n-1)/5, ", "))

(Other) sage: [lucas_number1(n, 7, 6) for n in xrange(1, 22)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 23 2009]

(Other) sage: [gaussian_binomial(n, 1, 6) for n in xrange(1, 22)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 28 2009]

CROSSREFS

Sequence in context: A043553 A049609 A161728 this_sequence A022036 A015451 A126502

Adjacent sequences: A003461 A003462 A003463 this_sequence A003465 A003466 A003467

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 21 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research