The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A053734

A000016-A000048 (when they are lined up so that the two 16's match).
(history; published version)

#12 by Michael De Vlieger at Sat Mar 26 11:09:16 EDT 2022

STATUS

reviewed

approved

#11 by Michel Marcus at Sat Mar 26 10:35:16 EDT 2022

STATUS

proposed

reviewed

#10 by Michael De Vlieger at Sat Mar 26 10:20:44 EDT 2022

STATUS

editing

proposed

#9 by Michael De Vlieger at Sat Mar 26 10:20:30 EDT 2022

MATHEMATICA

Table[DivisorSum[n, Mod[#, 2] EulerPhi[#]*2^(n/#)/(2 n) &] - DivisorSum[n, Total[MoebiusMu[#]*2^(n/#)]/(2 n) &, OddQ], {n, 69}] (* _Michael De Vlieger_, Mar 26 2022 *)

Discussion

Sat Mar 26

10:20

Michael De Vlieger: Thanks Michel

#8 by Michel Marcus at Sat Mar 26 01:07:27 EDT 2022

STATUS

proposed

editing

#7 by Michael De Vlieger at Fri Mar 25 16:55:21 EDT 2022

STATUS

editing

proposed

Discussion

Sat Mar 26

01:07

Michel Marcus: you forgot to sign Mma

#6 by Michael De Vlieger at Fri Mar 25 16:32:23 EDT 2022

LINKS

Yan Bo Ti, Gabriel Verret, and Lukas Zobernig, <a href="https://arxiv.org/abs/2203.08401">Abelian Varieties with p-rank Zero</a>, arXiv:2203.08401 [math.NT], 2022.

#5 by Michael De Vlieger at Fri Mar 25 16:31:47 EDT 2022

LINKS

Michael De Vlieger, <a href="/A053734/b053734.txt">Table of n, a(n) for n = 1..10000</a>

MATHEMATICA

Table[DivisorSum[n, Mod[#, 2] EulerPhi[#]*2^(n/#)/(2 n) &] - DivisorSum[n, Total[MoebiusMu[#]*2^(n/#)]/(2 n) &, OddQ], {n, 69}]

STATUS

approved

editing

#4 by Russ Cox at Fri Mar 30 16:48:45 EDT 2012

AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Mar 25 2000

Discussion

Fri Mar 30

16:48

OEIS Server: https://oeis.org/edit/global/110

#3 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

KEYWORD

nonn,new

nonn

AUTHOR

N. J. A. Sloane (njas, (AT)research.att.com), Mar 25 2000