The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A165912 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A165912

Number of alternating polynomials of degree 3n in GF(2)[X], n>0.
(history; published version)

#27 by Joerg Arndt at Sat Dec 16 05:23:55 EST 2017

STATUS

reviewed

approved

#26 by Michel Marcus at Sat Dec 16 01:08:18 EST 2017

STATUS

proposed

reviewed

#25 by G. C. Greubel at Fri Dec 15 23:23:03 EST 2017

STATUS

editing

proposed

#24 by G. C. Greubel at Fri Dec 15 23:22:55 EST 2017

LINKS

G. C. Greubel, <a href="/A165912/b165912.txt">Table of n, a(n) for n = 1..3300</a>

STATUS

approved

editing

#23 by N. J. A. Sloane at Thu Dec 03 11:23:09 EST 2015

STATUS

proposed

approved

#22 by Michel Marcus at Thu Dec 03 05:15:22 EST 2015

STATUS

editing

proposed

#21 by Michel Marcus at Thu Dec 03 03:50:47 EST 2015

FORMULA

a(n) = 2*(sum_{d|n, n/d != 0 mod 3} mu(n/d)*(2^d - (-1)^d))/(3n).

STATUS

proposed

editing

#20 by Jean-François Alcover at Thu Dec 03 03:28:27 EST 2015

STATUS

editing

proposed

#19 by Jean-François Alcover at Thu Dec 03 03:28:21 EST 2015

MATHEMATICA

a[n_] := 2*DivisorSum[n, Boole[Mod[n/#, 3] != 0] MoebiusMu[n/#]*(2^# - (-1)^#) &]/(3 n); Array[a, 40] (* Jean-François Alcover, Dec 03 2015, adapted from PARI *)

STATUS

approved

editing

#18 by Michel Marcus at Mon Oct 07 11:21:46 EDT 2013

STATUS

reviewed

approved