Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076178
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076178 a(n)=2*n^2-A077071(n). +0
3
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; listen)
OFFSET

0,4

LINKS

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

PROGRAM

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

CROSSREFS

Equals 2 * A078903(n).

Sequence in context: A018061 A166289 A071058 this_sequence A060988 A034406 A098330

Adjacent sequences: A076175 A076176 A076177 this_sequence A076179 A076180 A076181

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 01 2002

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research