[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A328186 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A328186 Write 1/(1 + sin x) = Product_{n>=1} (1 + f_n x^n); a(n) = denominator(f_n).
(history; published version)
#45 by N. J. A. Sloane at Mon Oct 07 14:15:09 EDT 2019
STATUS

proposed

approved

#44 by Michel Marcus at Mon Oct 07 12:29:00 EDT 2019
STATUS

editing

proposed

Discussion
Mon Oct 07 12:30
Petros Hadjicostas: What is the meaning of the word "frac"? Does it indicate that we have numerators or denominators of fractions?
14:15
N. J. A. Sloane: "What is the meaning of the word "frac"? Does it indicate that we have numerators or denominators of fractions?"
 Yes
#43 by Michel Marcus at Mon Oct 07 12:28:50 EDT 2019
KEYWORD

nonn,frac,new

STATUS

proposed

editing

Discussion
Mon Oct 07 12:29
Michel Marcus: ok for keyword frac ?
#42 by Petros Hadjicostas at Mon Oct 07 12:20:50 EDT 2019
STATUS

editing

proposed

#41 by Petros Hadjicostas at Mon Oct 07 12:20:43 EDT 2019
COMMENTS

Wolfdieter Lang (see the link below) examined inverse power product expansions both for ordinary g.f.'s and for exponential g.f.'s. He connects inverse power product expansions to unital series associated to (infinite dimesionaldimensional) Witt vectors and to the so-called "Somos transformation".

MAPLE

h1h := map(denom, PPE(100, 40)); # Petros Hadjicostas, Oct 06 2019 by modifying N. J. A. Sloane's program from A170912 and A170913.

CROSSREFS

Numerators are in A328191.

STATUS

approved

editing

#40 by Bruno Berselli at Mon Oct 07 03:05:00 EDT 2019
STATUS

reviewed

approved

#39 by Joerg Arndt at Mon Oct 07 01:33:44 EDT 2019
STATUS

proposed

reviewed

Discussion
Mon Oct 07 01:36
Petros Hadjicostas: I will do the numerator case some other day.
#38 by Petros Hadjicostas at Mon Oct 07 01:14:10 EDT 2019
STATUS

editing

proposed

#37 by Petros Hadjicostas at Mon Oct 07 01:11:02 EDT 2019
COMMENTS

There are more formulas for f_n and g_n in the references listed below. In all cases, we assume the g.f.'s are unital, i.e., the g.f.'s start with a constant 1.

#36 by Petros Hadjicostas at Mon Oct 07 01:09:31 EDT 2019
COMMENTS

Gingold and Knopfmacher (1995) and Alkauskas (2008, 2009) proved that f_n = -g_n for n odd, and Sum_{s|n} (-g_{n/s})^s/s = -Sum_{s|n} (-f_{n/s})^s/s. [We caution that different authors may use -g_n for g_n , or -f_n for f_n, or both.]

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)