47610

Appears in sequences

• Duplicate of A089117.at n=14A089100
• Convoluted convolved Fibonacci numbers G_j^(4).at n=14A089117
• Number of double eliminations of twin prime candidates within primorial intervals of prime(n)#.at n=7A121407
• Concatenation of n-th prime and n-th Fibonacci number.at n=14A138822
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,2,1,1,1 for x=0,1,2,3,4.at n=6A197608
• Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,2,1,1,1 for x=0,1,2,3,4.at n=2A197612
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,2,1,1,1 for x=0,1,2,3,4.at n=38A197613
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,2,1,1,1 for x=0,1,2,3,4.at n=42A197613
• Number of partitions p of n such that (number of numbers in p of form 3k) < (number of numbers in p of form 3k+1).at n=45A241743
• G.f. A(x) satisfies: A(x) = 1 + Sum_{k>=1} mu(k)*x^k*A(x)^k/(1 - x^k*A(x)^k)^2, where mu() is the Möbius function (A008683).at n=10A307487
• Number of cyclic permutations of length n that avoid the pattern 132 (equivalently, 213).at n=13A309505
• Number of n element multisets of the 30th roots of unity with zero sum.at n=11A321419
• Triangle read by rows: Take a pentagram with all diagonals drawn, as in A331906. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+2.at n=25A331907
• Number of minimum sized maximal subsets of {1..n} such that every pair of distinct elements has a different difference.at n=46A382396