33026

Appears in sequences

• 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=41A065160
• Number of cases in which the first player gets killed in a Russian roulette game when 7 players use a gun with n chambers and the number of the bullets can be from 1 to n. In the game they do not rotate the cylinder after the game starts.at n=15A117302
• Second edge diagonal of table A176577. (The first edge diagonal is A099627).at n=42A176575
• T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=46A231246
• Number of 2 X n 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=8A231247
• Riordan array (1/(1-3*x), (1-3*x-sqrt(1-6*x+5*x^2))/(2*x)).at n=38A236420
• 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 403", based on the 5-celled von Neumann neighborhood.at n=32A288018
• Numbers k for which rank of the elliptic curve y^2=x^3-k*x is 4.at n=23A309034
• Number of weakly unimodal compositions of n in which the greatest part occurs exactly six times.at n=53A320317
• Number of factorizations of 2^n into factors > 1 with integer average.at n=50A326667
• Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution x to A328248(x) = n-1.at n=34A328250
• a(n) = Sum_{k=0..n} k^(n-k) * Stirling1(n,k).at n=7A350726