33028

Appears in sequences

• Royal paths in a lattice (convolution of A006318).at n=8A006319
• Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=43A033877
• a(n)=T(n,n+2), array T as in A049600.at n=7A049608
• Numbers k such that 2^k + 3 is prime.at n=38A057732
• Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.at n=43A065160
• Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.at n=35A073150
• Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.at n=36A073151
• Formal inverse of triangle A080246. Unsigned version of A080245.at n=37A080247
• Triangular array associated with Schroeder numbers: T(0,0) = 1, T(n,0) = 0 for n > 0; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=53A106579
• Riordan array (1, x*f(x)) where f(x)is the g.f. of A006318.at n=47A122538
• Triangle T(n,k), 0<=k<=n, read by rows given by [1,1,2,1,2,1,2,1,2,1,2,...] DELTA [1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=37A167656
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood.at n=36A271154
• Numbers whose sum of divisors is equal to the product of the number of divisors of their k first powers, for some k.at n=41A283758
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 366", based on the 5-celled von Neumann neighborhood.at n=36A287854
• Triangle read by rows, T(n, k) = (-1)^(n-k)*binomial(n,k)*hypergeom([k - n, n + 1], k + 1, 2), for n >= 0 and 0 <= k <= n.at n=48A297898
• Array read by antidiagonals: T(m,n) = number of Eulerian orientations of the torus grid graph C_m X C_n.at n=38A298119
• Array read by antidiagonals: T(m,n) = number of Eulerian orientations of the torus grid graph C_m X C_n.at n=42A298119
• Numbers that are divisible by the total number of 1's in both the Zeckendorf and the dual Zeckendorf representations of all their divisors (A300837 and A333618).at n=18A333621
• Regular triangle read by rows, T(n,k) = T(n,k-1)+2*T(n-1,k)-T(n-1,k-1) for 1<=k<=n-2 with T(n,n)=T(n,n-1)=T(n,n-2) for n>=3 and T(1,1)=T(2,1)=T(2,2)=1.at n=51A341695