43211

Appears in sequences

• n written in fractional base 5/4.at n=21A024634
• Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).at n=38A059321
• The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).at n=36A071157
• Digit reversal of A096299(n).at n=22A096104
• Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 43 for n > 0.at n=10A101077
• a(n) = 4*n^4 + 3*n^3 + 2*n^2 + n + 1.at n=10A130886
• a(n)=n*(10^K) + a(n-1); a(0)=1; K=floor(log_10 a(n-1))+1.at n=4A136307
• Expansion of 1/((1-2*x)*(1-3*x+3*x^2)*(1-4*x+6*x^2-4*x^3)).at n=9A201458
• Numbers k such that the sum of the first k consecutive prime numbers is pandigital (includes all 10 digits at least once).at n=16A228468
• Number of n X 4 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A301527
• Number of nX6 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A301529
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=39A301531
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=41A301531
• Sum of the largest parts of the partitions of n into 10 parts.at n=40A326598
• Number of partitions of 4n whose xor-sum is 2n.at n=15A370874