19464

Appears in sequences

• Number of planted identity trees where non-root, non-leaf nodes an even distance from root are of degree 2.at n=21A007560
• Numbers k that, when expressed in base 6 and then interpreted in base 8, give a multiple of k.at n=22A062937
• a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A000984(k) = C(2*k,k) equals n.at n=29A081393
• a(n) is the smallest value of k such that number of non-unitary prime divisors of k-th Catalan number, A000108(k) = C(2*k,k)/(k+1) equals n.at n=28A081395
• Expansion of 1 / ((1-x-x^2-x^3)*(1-x^2-x^3)).at n=16A103322
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three or four distinct values for every i,j,k<=n.at n=10A211722
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (4,n)-rectangular grid with k '1's and (4n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=52A225812
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (5,n)-rectangular grid with k '1's and (5n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=41A228022
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (5,n)-rectangular grid with k '1's and (5n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=47A228022
• Number of partitions of 4n into 4 parts.at n=34A238340
• Numbers n such that the sum of the non-anti-divisors of n is a multiple of the sum of the anti-divisors of n.at n=16A245649
• Number of partitions of 5n into exactly 4 parts.at n=28A256327
• Number of partitions of 7n into exactly 4 parts.at n=20A256329
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=30A271248
• Number of partitions of n*(n-1)/2 into at most four parts.at n=16A274099
• Expansion of Sum_{p prime, i>=1} x^(p^i)/(1 - x^(p^i)) / Product_{p prime, j>=1} (1 - x^(p^j)).at n=40A281616
• Total number of neighbor contacts for n-step self-avoiding walks on a 2D square lattice.at n=8A336492
• a(n) is the Wiener index of a tridon on n vertices.at n=44A349418
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+3,4*n-8*k+3).at n=29A390040
• a(n) = Sum_{k=0..floor((2*n+1)/7)} binomial(2*k+1,2*n-7*k+1).at n=31A392488