Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110207
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110207 a(n) = sum of cubes of numbers < 2^n having exactly [n/2]+1 ones in their binary expansion. +0
3
1, 27, 368, 6615, 88536, 1449198, 20078192, 320944275, 4584724120, 72867715074, 1064153845776, 16896536592390, 250629464211504, 3980364331323996, 59709362473177824, 948742244639103915, 14352114907032903000 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) equals the largest term in row n of triangle A110205.

FORMULA

a(n) = (8^n-1)/7*C(n-3, [n/2]) + ((2^n-1)*(4^n-1)-(8^n-1)/7)*C(n-3, [n/2]-1) + (2^n-1)^3*C(n-3, [n/2]-2).

PROGRAM

(PARI) {a(n)=(8^n-1)/7*binomial(n-3, n\2)+((2^n-1)*(4^n-1)-(8^n-1)/7)*binomial(n-3, n\2-1) +(2^n-1)^3*binomial(n-3, n\2-2)}

CROSSREFS

Cf. A110205 (triangle), A110206 (row sums).

Sequence in context: A022622 A030648 A042410 this_sequence A010979 A022591 A000535

Adjacent sequences: A110204 A110205 A110206 this_sequence A110208 A110209 A110210

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 16 2005

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 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research