Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138247
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138247 E.g.f.: A(x) = Sum_{n>=0} exp((2^n+3^n)*x) * (2^n+3^n)^n * x^n/n!. +0
2
1, 7, 223, 49849, 94705663, 1616229320497, 251286598125520183, 357716675257916544062689, 4670472774542449929397808845183, 559006854195449142958954163012808059617 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = Sum_{k=0..n} C(n,k)*(2^k + 3^k)^n.

a(n) = Sum_{k=0..n} C(n,k)*(1 + 2^(n-k)*3^k)^n.

a(n) = Sum_{k=0..n} C(n,k)*A007689(k)^n.

a(n) = Sum_{k=0..n} C(n,k)*A094617(n,k)^n.

EXAMPLE

a(1) = 2 + 5 = 3 + 4 = 7 ;

a(2) = 2^2 + 2*5^2 + 13^2 = 5^2 + 2*7^2 + 10^2 = 223 ;

a(3) = 2^3 + 3*5^3 + 3*13^3 + 35^3 = 9^3 + 3*13^3 + 3*19^3 + 28^3 = 49849.

When p=2, q=3, this sequence illustrates the following identity:

Sum_{k=0..n} C(n,k)*(p^k + q^k)^n =

Sum_{k=0..n} C(n,k)*(1 + p^(n-k)*q^k)^n

which is a special case of the more general binomial identity:

Sum_{k=0..n} C(n,k)*(s*p^k + t*q^k)^(n-k) * (u*p^k + v*q^k)^k =

Sum_{k=0..n} C(n,k)*(s + u*p^(n-k)*q^k)^(n-k) * (t + v*p^(n-k)*q^k)^k.

PROGRAM

(PARI) {a(n)=local(p=2, q=3, s=1, t=1, u=1, v=1);

sum(k=0, n, binomial(n, k)*(s*p^k + t*q^k)^(n-k)*(u*p^k + v*q^k)^k)}

/* right side of the general binomial identity: */

{a(n)=local(p=2, q=3, s=1, t=1, u=1, v=1);

sum(k=0, n, binomial(n, k)*(s + u*p^(n-k)*q^k)^(n-k) * (t + v*p^(n-k)*q^k)^k)}

CROSSREFS

Cf. A007689, A094617.

Sequence in context: A114939 A140018 A009488 this_sequence A015506 A142606 A123832

Adjacent sequences: A138244 A138245 A138246 this_sequence A138248 A138249 A138250

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna@juno.com), Mar 09 2008, revised Mar 11 2008

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 September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research