Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075780
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075780 Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below. +0
4
0, 3, 3, 12, 14, 12, 30, 45, 45, 30, 60, 114, 138, 114, 60, 105, 245, 357, 357, 245, 105, 168, 468, 808, 960, 808, 468, 168, 252, 819, 1647, 2286, 2286, 1647, 819, 252, 360, 1340, 3090, 4935, 5740, 4935, 3090, 1340, 360, 495, 2079, 5423, 9834, 13090, 13090, 9834, 5423 (list; table; graph; listen)
OFFSET

2,2

LINKS

Michel Lassalle, A new family of positive integers

FORMULA

f(n, p, k) = binomial(n, k)*hypergeom([1-k, -p, p-n], [1-n, 1], 1).

MAPLE

f := proc(n, p, k) convert( binomial(n, k)*hypergeom([1-k, -p, p-n], [1-n, 1], 1), `StandardFunctions`); end;

CROSSREFS

Cf. A014410 and A007318 for f(n,k,n), A075779 and A075798 for f(n,k,n-1) and A075780 and A075837 for f(n,k,n-2).

Sequence in context: A117856 A073055 A074850 this_sequence A078666 A006804 A052533

Adjacent sequences: A075777 A075778 A075779 this_sequence A075781 A075782 A075783

KEYWORD

nonn,tabl

AUTHOR

njas, Oct 17 2002

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research