34704

Appears in sequences

• Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker with two jokers wild.at n=6A053083
• Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker with two jokers wild.at n=4A053084
• Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.at n=5A057798
• Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 2 pair, 3 of a kind, a pair in wild-card poker with 2 jokers.at n=5A057800
• Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.at n=5A057806
• Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=40A117395
• Number of permutations of floor(i*7/4), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152359
• E.g.f. satisfies: A(x) = exp( Integral A(x)/(1 - x*A(x)^2) dx ).at n=6A224788
• Least positive integer k such that prime(k)-k, prime(k)+k, prime(k*n)-k*n, prime(k*n)+k*n, prime(k)+k*n and prime(k*n)+k are all prime.at n=34A259492
• Number of nX5 0..1 arrays with every element equal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A298716
• Number of nX6 0..1 arrays with every element equal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A298717
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=49A298719
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=50A298719
• a(n) = 136*2^n - 112.at n=8A305165
• (1/n) times the sum of the elements of all subsets of [n] whose sum is divisible by n.at n=16A309128
• Expansion of g.f. A(x) satisfying [x^(n-1)] (1 + (n+1)*x*A(x))^n / A(x)^n = n*(n+2)^(n-2) for n > 1.at n=9A365574