23230

Appears in sequences

• Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=16A084276
• Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal.at n=24A135120
• Numbers such that the digital sum base 2 and the digital sum base 5 and the digital sum base 10 all are equal.at n=20A135125
• Numbers such that the digital sums in bases 2, 3, 5 and 10 all are equal.at n=3A135128
• Number of binary strings of length n with equal numbers of 00110 and 01100 substrings.at n=15A164253
• O.g.f.: 1/(1-x) * Sum_{n>=0} 1/(1-(n+1)*x)^n * x^n/n! * exp(-x/(1-(n+1)*x)).at n=9A185040
• Number of n X 5 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=7A223774
• G.f.: Product_{k>=1} 1/(1-x^k)^Fibonacci(k+2).at n=12A260787
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 643", based on the 5-celled von Neumann neighborhood.at n=25A273314
• a(n) = 5*(n+1)*(9*n+4).at n=22A304507
• Smallest positive integer that has exactly n representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=13A317385
• Square array read by antidiagonals in which T(n,k) is the n-th even number j with the property that the symmetric representation of sigma(j) has k parts.at n=34A320537