Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034850
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034850 Triangular array formed by taking every other term of Pascal's triangle. +0
2
1, 1, 2, 1, 3, 1, 6, 1, 5, 10, 1, 6, 20, 6, 1, 21, 35, 7, 1, 28, 70, 28, 1, 9, 84, 126, 36, 1, 10, 120, 252, 120, 10, 1, 55, 330, 462, 165, 11, 1, 66, 495, 924, 495, 66, 1, 13, 286, 1287, 1716, 715, 78, 1, 14, 364, 2002, 3432, 2002, 364, 14, 1, 105, 1365, 5005, 6435 (list; graph; listen)
OFFSET

0,3

LINKS

D. Dumont and J. Zeng, Polynomes d'Euler et les fractions continues de Stieltjes-Rogers, Ramanujan J. 2 (1998) 3, 387-410.

EXAMPLE

Triangle begins:

1;

1;

2;

1,3;

1,6,1;

5,10,1;

6,20,6;

1,21,35,7;

PROGRAM

(PARI) T(n, k)=if(k<0|k>n\4+(n+1)\4, 0, binomial(n, 2*k+(n+1)\2%2))

CROSSREFS

a(n)=A007318(2n) if both are regarded as integer sequences.

Bisection of A007318. Cf. A034839.

Sequence in context: A022458 A084419 A119606 this_sequence A145969 A140352 A082588

Adjacent sequences: A034847 A034848 A034849 this_sequence A034851 A034852 A034853

KEYWORD

nonn,easy,tabf

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research