login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A199656
Triangular array read by rows, T(n,k) is the number of functions from {1,2,...,n} into {1,2,...,n} with maximum value of k.
7
1, 1, 3, 1, 7, 19, 1, 15, 65, 175, 1, 31, 211, 781, 2101, 1, 63, 665, 3367, 11529, 31031, 1, 127, 2059, 14197, 61741, 201811, 543607, 1, 255, 6305, 58975, 325089, 1288991, 4085185, 11012415
OFFSET
1,3
COMMENTS
Row sums = A000312.
Main diagonal = A045531.
LINKS
Vincenzo Librandi, Rows n = 1..60, flattened
FORMULA
T(n,k) = k^n-(k-1)^n.
EXAMPLE
Triangle begins:
1
1 3
1 7 19
1 15 65 175
1 31 211 781 2101
1 63 665 3367 11529 31031
1 127 2059 14197 61741 201811 543607 etc.
MATHEMATICA
Table[Table[(1-((i-1)/i)^n) i^n, {i, 1, n}], {n, 1, 8}]//Grid
Flatten[Table[k^n - (k-1)^n, {n, 0, 10}, {k, 1, n}]] (* Vincenzo Librandi, Jan 28 2013 *)
PROG
(Magma) /* As triangle: */ [[k^n - (k-1)^n: k in [1..n]]: n in [1..9]]; // Vincenzo Librandi, Jan 28 2013
CROSSREFS
Sequence in context: A282605 A281525 A096643 * A221345 A036575 A347485
KEYWORD
nonn,easy,tabl
AUTHOR
Geoffrey Critzer, Nov 08 2011
STATUS
approved