Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079727
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079727 a(n)=1+C(2,1)^3+C(4,2)^3+...+C(2n,n)^3. +0
9
1, 9, 225, 8225, 351225, 16354233, 805243257, 41229480825, 2172976383825, 117106008311825, 6423711336265041, 357470875526646609, 20131502573232075025, 1145190201805448075025, 65706503254247744075025 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n) seems to have an interesting congruence property: For p prime, a(p)==8 (mod p) if and only p == 3, 5, 7, or 13 (mod 14); i.e. iff p=7 or p is in A003625.

FORMULA

a(n)=sum(k=0, n, binomial(2*k, k)^3)

G.f.: hypergeom([1/2, 1/2, 1/2], [1, 1], 64*x)/(1-x). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 18 2003

PROGRAM

(PARI) a(n)=sum(k=0, n, binomial(2*k, k)^3)

CROSSREFS

Cf. A002476, A006134 (sum(k=0, n, binomial(2*k, k)).

Sequence in context: A063392 A012831 A012749 this_sequence A128492 A001818 A095363

Adjacent sequences: A079724 A079725 A079726 this_sequence A079728 A079729 A079730

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 17 2003

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research