Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152802
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152802 a(n) = A152800(n+2,2n+1) for n>=0. +0
3
1, 3, 10, 41, 172, 749, 3332, 15041, 68640, 315840, 1462798, 6810588, 31846811, 149459541, 703592472, 3321019270, 15711717162, 74482623635, 353723268817, 1682536854931, 8014676326925, 38226681972410, 182538225520073 (list; graph; listen)
OFFSET

0,2

COMMENT

Triangle A152800 gives a q-analog of the Euler numbers.

PROGRAM

(PARI) {a(n)=polcoeff(polcoeff(1/sum(m=0, n+2, (-1)^m*x^(2*m)/prod(j=1, 2*m, (q^j-1)/(q-1))+x*O(x^(2*n+4))), 2*n+4, x)*prod(j=1, 2*n+4, (q^j-1)/(q-1)), 2*n+1, q)}

CROSSREFS

Cf. A152800; A152801.

Sequence in context: A151080 A153474 A151081 this_sequence A151082 A151083 A140046

Adjacent sequences: A152799 A152800 A152801 this_sequence A152803 A152804 A152805

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 26 2008

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research