36252

Appears in sequences

• a(n) is the concatenation of n and 7n.at n=35A009441
• Triangle read by rows of numbers b_{n,k}, n >= 2, 1 <= k < n such that (1/(1-q*t))*Product_{n,k} 1/(1 - q^n*t^k)^b_{n,k} = Sum_{i,j>=1} S_{i,j} q^i*t^j where S_{i,j} are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind).at n=51A112339
• Triangle read by rows of numbers b_{n,k}, n>=1, 1<=k<=n such that Product_{n,k} 1/(1-q^n t^k)^{b_{n,k}} = 1 + Sum_{i,j>=1} S_{i,j} q^i t^j where S_{i,j} are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind).at n=61A112340
• a(n) = (prime(n)^3 - prime(n^3))/2.at n=14A143680
• Number of (n+1)X(n+1) -5..5 symmetric matrices with every 2X2 subblock having sum zero and two or three distinct values.at n=9A211332
• Numbers k such that sigma(k) = sigma(k - d(k)).at n=36A277273
• Number of multisets of exactly n nonempty words with a total of 2n letters over 2n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A293809
• Number of multisets of exactly nine nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A294011
• Number of multisets of exactly ten nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A294012
• Expansion of e.g.f. Sum_{k>=0} (2*k)! * log(1+x)^k / k!.at n=4A354243