The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A116488

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A116488

Number of factorizations of n into evil numbers.
(history; published version)

#7 by Susanna Cuyler at Sat Mar 27 08:06:31 EDT 2021

STATUS

proposed

approved

#6 by David A. Corneth at Sat Mar 27 07:58:10 EDT 2021

STATUS

editing

proposed

Discussion

Sat Mar 27

07:59

David A. Corneth: Thanks. Fixed it here. A116489 doesn't need it as it holds for n = 1 there.

#5 by David A. Corneth at Sat Mar 27 07:58:04 EDT 2021

COMMENTS

a(2*n) >= a(n) for n > 1. - David A. Corneth, Mar 27 2021

STATUS

proposed

editing

#4 by David A. Corneth at Sat Mar 27 07:07:03 EDT 2021

STATUS

editing

proposed

Discussion

Sat Mar 27

07:44

Amiram Eldar: But a(2*1)=0 is not >= a(1)=1.

#3 by David A. Corneth at Sat Mar 27 07:05:04 EDT 2021

COMMENTS

a(2*n) >= a(n). - David A. Corneth, Mar 27 2021

LINKS

David A. Corneth, <a href="/A116488/b116488.txt">Table of n, a(n) for n = 1..10000</a>

CROSSREFS

Cf. A001969, A116489, A116490.

STATUS

approved

editing

#2 by Russ Cox at Fri Mar 30 17:37:16 EDT 2012

AUTHOR

_Christian G. Bower (bowerc(AT)usa.net), _, Feb 17 2006

Discussion

Fri Mar 30

17:37

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

#1 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

NAME

Number of factorizations of n into evil numbers.

DATA

1, 0, 1, 0, 1, 1, 0, 0, 2, 1, 0, 1, 0, 0, 2, 0, 1, 2, 0, 1, 0, 0, 1, 1, 1, 0, 3, 0, 1, 3, 0, 0, 1, 1, 0, 3, 0, 0, 1, 1, 0, 0, 1, 0, 4, 1, 0, 1, 0, 1, 2, 0, 1, 4, 0, 0, 1, 1, 0, 4, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 3, 0, 0, 3, 0, 1, 1, 0, 1, 4, 0, 1, 0, 2, 1, 1, 0, 1, 7, 0, 1, 0, 0, 1, 1, 0, 0, 2, 2, 1, 3, 0, 0, 1

OFFSET

1,9

FORMULA

Dirichlet g.f.: prod{n is in A001969}(1/(1-1/n^s)).

CROSSREFS

Cf. A116489, A116490.

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Feb 17 2006

STATUS

approved