Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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 A109449

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A109449 Triangle read by rows, T(n,k) = binomial(n,k)*A000111(n-k), 0 <= k <= n.
(history; published version)
#72 by Peter Luschny at Mon Jun 06 09:13:29 EDT 2022
STATUS

editing

approved

#71 by Peter Luschny at Mon Jun 06 09:12:55 EDT 2022
MAPLE

From Peter Luschny, Jul 10 2009, edited Jun 06 2022: (Start)

# Auxiliary functions

A109449 := (n, k) -> binomial(n, k)*A000111(n-k):

seq(print(seq(A109449(n, k), k=0..n)), n=0..9);

PowB109449 := (n, k) -> 2^(n-k)*binomial(n, k)*abs(euler(n-k, 1/2)+euler(n-k) -> `, 1)) -`if`(n=0 and -k=0, , 1, , 0): seq(print(seq(B109449(n^, k), k): # To avoid '=0^..n)), n=0 undefined'...9);

R109449 := proc(n, k) option remember; if k = 0 then A000111(n) else R109449(n-1, k-1)*n/k fi end: seq(print(seq(R109449(n, k), k=0..n)), n=0..9);

E109449 := proc(n) add(binomial(n, k)*euler(k)*((x+1)^(n-k)+ x^(n-k)), k=0..n) -x^n end: seq(print(seq(abs(coeff(E109449(n), x, k)), k=0..n)), n=0..9);

Euler := (sigma := n, x) -> `if`( -> ifelse(n=0, 1, [1, 1, 0, -1, -1, -1, 0, euler(1][n, x)): # Avoid the bugmod euler8 + 1]/2^iquo(0, n-1) = -, 2)-1.):

sigma := proc(n) local nmod8; nmod8 := n mod 8;

if n = 0 then RETURN(1) fi; if member(nmod8, {2, 6}) then RETURN(-1) fi;

if member(nmod8, {0, 1, 7}) then 1 else -1 fi; %*2^(-iquo(n-1, 2))-1 end:

A000111L109449 := proc(n -> 2^) add(add((-1)^v*binomial(k, v)*(x+v+1)^n*sigma(k), v=0..k), k=0..n) end: seq(print(seq(abs(coeff(EulerL109449(n, 1/2)+Euler(), x, k)), k=0..n, 1))-`if`()), n=0, 1, 0):..9);

# Coefficients

A109449 := proc(n, k) binomial(n, k)*A000111(n-k) end:

B109449 := proc(n, k) 2^(n-k)*binomial(n, k)*abs(Euler(n-k, 1/2)+Euler(n-k, 1)) -`if`(n-k=0, 1, 0) end:

R109449 := proc(n, k) option remember; if k = 0 then RETURN(A000111(n)) fi; R109449(n-1, k-1)*n/k end:

# Polynomials

E109449 := proc(n) local k; add(binomial(n, k)*euler(k)*(Pow(x+1, n-k)+ Pow(x, n-k)), k=0..n)-Pow(x, n) end:

L109449 := proc(n) local k, v; add(add((-1)^v*binomial(k, v)*Pow(x+v+1, n)* sigma(k), v=0..k), k=0..n) end:

X109449 := proc(n) -> n!*coeff(series(exp(x*t)*(sech(t)+tanh(t)), )), t, , 24), ), t, , n): seq(print(seq(abs(coeff(X109449(n), x, k)), k=0..n)), n)end:=0..9);

# Evaluate

seq(print(seq(A109449(n, k), k=0..n)), n=0..9);

seq(print(seq(B109449(n, k), k=0..n)), n=0..9);

seq(print(seq(R109449(n, k), k=0..n)), n=0..9);

seq(print(seq(abs(coeff(E109449(n), x, k)), k=0..n)), n=0..9);

seq(print(seq(abs(coeff(L109449(n), x, k)), k=0..n)), n=0..9);

seq(print(seq(abs(coeff(X109449(n), x, k)), k=0..n)), n=0..9); (End)

(End)

STATUS

approved

editing

Discussion
Mon Jun 06 09:13
Peter Luschny: I edited the Maple code because it refered to an ancient buggy version of Maple and used workarounds (see the old comments).
#70 by Peter Luschny at Wed Feb 17 06:38:30 EST 2021
STATUS

reviewed

approved

#69 by Michel Marcus at Wed Feb 17 06:24:30 EST 2021
STATUS

proposed

reviewed

Discussion
Wed Feb 17 06:24
Michel Marcus: For this, I think you need to ask Neil
06:26
Petros Hadjicostas: I already sent him an email about A058878 (see my comments there) about the length of each row in that irregular triangular array...
#68 by Petros Hadjicostas at Wed Feb 17 06:16:31 EST 2021
STATUS

editing

proposed

Discussion
Wed Feb 17 06:17
Petros Hadjicostas: Same typo is repeated 46 times!!! Can you please fix it? I will fix a few of them, but I cannot do all of them.
#67 by Petros Hadjicostas at Wed Feb 17 06:16:22 EST 2021
LINKS

J. Millar, N. J. A. Sloane and N. E. Young, A new operation on sequences: the Boustrophedon on transform, J. Combin. Theory, 17A 44-54 1996 (<a href="http://neilsloane.com/doc/bous.txt">Abstract</a>, <a href="http://neilsloane.com/doc/bous.pdf">pdf</a>, <a href="http://neilsloane.com/doc/bous.ps">ps</a>).

STATUS

approved

editing

#66 by Peter Luschny at Thu Aug 27 10:56:10 EDT 2020
STATUS

editing

approved

#65 by Peter Luschny at Thu Aug 27 10:55:50 EDT 2020
COMMENTS

T(n,k) = abs(A247453(n,k)). - Reinhard Zumkeller, Sep 17 2014

FORMULA

T(n,k) = abs(A247453(n,k)). - Reinhard Zumkeller, Sep 17 2014

STATUS

approved

editing

Discussion
Thu Aug 27 10:56
Peter Luschny: Moved to Formulas.
#64 by Peter Luschny at Sat Mar 14 10:28:46 EDT 2020
STATUS

proposed

approved

#63 by F. Chapoton at Sat Mar 14 07:16:35 EDT 2020
STATUS

editing

proposed

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 September 11 08:57 EDT 2024. Contains 375814 sequences. (Running on oeis4.)