Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070832
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070832 a(n)=Sum_{k=0..n} binomial(8*n,8*k). +0
2
1, 2, 12872, 1470944, 622116992, 125858012672, 36758056208384, 8793364151263232, 2334899414608412672, 586347560750962049024, 151652224498623981289472, 38612725801339748322639872 (list; graph; listen)
OFFSET

0,2

FORMULA

Let b(n)=a(n)-2^(8*n)/8 then b(n)+120*b(n-1)-2160*b(n-2)-256*b(n-3)=0. - Benoit Cloitre (benoit7848c(AT)orange.fr), May 27 2004

1/4*16^n + 1/8*256^n + 1/4*(-68 + 48*sqrt(2))^n + 1/4*(-68-48*sqrt(2))^n.

PROGRAM

(PARI) a(n)=sum(k=0, n, binomial(8*n, 8*k)). - Benoit Cloitre (benoit7848c(AT)orange.fr), May 27 2004

CROSSREFS

Cf. A070967, A070782, A070775.

Adjacent sequences: A070829 A070830 A070831 this_sequence A070833 A070834 A070835

Sequence in context: A082912 A083973 A094212 this_sequence A124364 A123692 A132942

KEYWORD

easy,nonn

AUTHOR

Sebastian Gutierrez and Sarah Kolitz (skolitz(AT)mit.edu), May 15 2002

EXTENSIONS

Edited by njas at the suggestion of Andrew Plewe, Jun 15 2007

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research