login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110207 a(n) = sum of cubes of numbers < 2^n having exactly [n/2]+1 ones in their binary expansion. 2
1, 27, 368, 6615, 88536, 1449198, 20078192, 320944275, 4584724120, 72867715074, 1064153845776, 16896536592390, 250629464211504, 3980364331323996, 59709362473177824, 948742244639103915, 14352114907032903000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

Table of n, a(n) for n=1..17.

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).

PROG

(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: A223278 A278091 A042410 * A223205 A257786 A161530

Adjacent sequences:  A110204 A110205 A110206 * A110208 A110209 A110210

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Jul 16 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 14 00:42 EDT 2021. Contains 342941 sequences. (Running on oeis4.)