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!)
A076178 a(n) = 2*n^2 - A077071(n). 2
0, 0, 0, 2, 2, 4, 6, 10, 10, 12, 14, 18, 20, 24, 28, 34, 34, 36, 38, 42, 44, 48, 52, 58, 60, 64, 68, 74, 78, 84, 90, 98, 98, 100, 102, 106, 108, 112, 116, 122, 124, 128, 132, 138, 142, 148, 154, 162, 164, 168, 172, 178, 182, 188, 194, 202, 206, 212, 218, 226, 232 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..60.

Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, preprint, 2016.

Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai, Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms 13:4 (2017), #47.

Ralf Stephan, Some divide-and-conquer sequences with (relatively) simple generating functions, 2004.

Ralf Stephan, Table of generating functions (ps file).

Ralf Stephan, Table of generating functions (pdf file).

PROG

(PARI) a(n)=2*n^2-sum(k=0, n, -valuation(polcoeff(pollegendre(2*n), 2*k), 2))

CROSSREFS

Equals 2 * A078903(n).

Cf. A067699, A077070, A077071.

Sequence in context: A173495 A166289 A071058 * A308907 A285908 A060988

Adjacent sequences:  A076175 A076176 A076177 * A076179 A076180 A076181

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Nov 01 2002

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 October 28 20:51 EDT 2020. Contains 338064 sequences. (Running on oeis4.)