18628

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=22A031842
• Number of partitions of n into parts not of the form 19k, 19k+6 or 19k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=38A035975
• Number of deterministic completely defined initially connected acyclic automata with 2 inputs and n transient unlabeled states (and a unique absorbing state).at n=5A082161
• Triangular matrix, read by rows, that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (n+1).at n=21A102086
• Triangle, read by rows, where T(n,k) = T(n,k-1) + (k+1)*T(n-1,k) for n>k>0, T(n,0)=1 and T(n,n) = T(n,n-1) for n>=0.at n=26A102316
• Triangle, read by rows, where T(n,k) = T(n,k-1) + (k+1)*T(n-1,k) for n>k>0, T(n,0)=1 and T(n,n) = T(n,n-1) for n>=0.at n=27A102316
• Triangle, read by rows, equal to the matrix inverse of A104416, where A104416(n,k) = A008275(k+1,n-k+1) (Stirling numbers of the first kind).at n=21A104417
• Triangle, read by rows, equal to the matrix inverse of A104416, where A104416(n,k) = A008275(k+1,n-k+1) (Stirling numbers of the first kind).at n=22A104417
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -(k+1)*T(n-1,k) when (n-1)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (n+1) for n>=0.at n=21A106208
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -k^2*T(n-2,k) when (n-2)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (2*n+1) for n>=0.at n=21A106210
• Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -k^2*T(n-2,k) when (n-2)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (2*n+1) for n>=0.at n=22A106210
• T(n,k) is the number of unlabeled acyclic single-source automata with n transient states on a (k+1)-letter input alphabet.at n=15A128249
• Triangle, read by rows, where T(n,k) = T(n,k-1) + n*T(n-1,k-1) for n>0 and k>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=24A132007
• Integers k such that 10^k + 51 is a prime number.at n=13A135118
• Indices m such that A128646(m)-1 is prime, where A128646 = denominator of partial sums of 1/(p(i)-1).at n=52A137689
• Expansion of (1 + x) / ((1 - x^4) * (1 - x - x^5)) in powers of x.at n=34A247907
• Indices n such that A272464(n)=1.at n=22A272465
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 841", based on the 5-celled von Neumann neighborhood.at n=25A273685
• Number of ways of partitioning the set of the first n positive squares into two subsets whose sums differ at most by 1.at n=25A307877
• Numbers which can be written uniquely as x^4 + y*(2y+1) + z*(3z+1), where x,y,z are integers with x>=0.at n=30A334147