Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141684
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141684 Triangle read by rows formed from Euler polynomials: p(x,n)=If[Mod[n, 2] == 1, 2^(1 + ((n - 1)/2))*EulerE[n, x], EulerE[n, x]]; t(n,m)=Coefficients(p(x,n). +0
1
1, -1, 2, 0, -1, 1, 1, 0, -6, 4, 0, 1, 0, -2, 1, -4, 0, 20, 0, -20, 8, 0, -3, 0, 5, 0, -3, 1, 34, 0, -168, 0, 140, 0, -56, 16, 0, 17, 0, -28, 0, 14, 0, -4, 1, -496, 0, 2448, 0, -2016, 0, 672, 0, -144, 32, 0, -155, 0, 255, 0, -126, 0, 30, 0, -5, 1 (list; table; graph; listen)
OFFSET

1,3

COMMENT

Row sums are: {1, 1, 0, -1, 0, 4, 0, -34, 0, 496, 0, ...}.

EXAMPLE

{1},

{-1, 2},

{0, -1, 1},

{1, 0, -6, 4},

{0, 1, 0, -2, 1},

{-4, 0,20, 0, -20, 8},

{0, -3, 0, 5, 0, -3, 1},

{34, 0, -168, 0, 140, 0, -56, 16},

{0, 17, 0, -28, 0, 14, 0, -4,1},

{-496, 0, 2448, 0, -2016, 0, 672, 0, -144, 32},

{0, -155, 0, 255, 0, -126, 0, 30, 0, -5, 1}

MATHEMATICA

T[x_, n_] := If[Mod[n, 2] == 1, 2^(1 + ((n - 1)/2))*EulerE[n, x], EulerE[n, x]]; Table[Expand[T[x, n]], {n, 0, 10}]; Table[CoefficientList[T[x, n], x], {n, 0, 10}]; Flatten[%]

CROSSREFS

Cf. A060083, A004172, etc.

Sequence in context: A074169 A099362 A058940 this_sequence A152492 A075446 A142724

Adjacent sequences: A141681 A141682 A141683 this_sequence A141685 A141686 A141687

KEYWORD

tabl,sign,more

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Sep 08 2008

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jan 06 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research