29242

Appears in sequences

• Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.at n=9A094831
• Central coefficients of number triangle A113582.at n=18A154323
• Triangle T(n,k) = A008292(n+1,k+1) + A176487(n,k) - 1, 0<=k<=n.at n=38A176488
• Triangle T(n,k) = A008292(n+1,k+1) + A176487(n,k) - 1, 0<=k<=n.at n=42A176488
• Least number r such that r == k-1 (mod prime(k)) for k = 1..n.at n=5A187930
• Expansion of (1 - x^2)/(1 - 3*x^2 - x^3).at n=18A188048
• a(n) = 3*a(n-1) + 24*a(n-2) + a(n-3), with a(0)=a(1)=1, and a(2)=19.at n=6A217052
• Total number of smallest parts that are also emergent parts in all partitions of n.at n=44A220479
• Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=27A271311
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 969", based on the 5-celled von Neumann neighborhood.at n=27A273849
• The base 10 numbers with a digit product > 0 and which when written in bases 3,4,5,6,7,8,9 have two or more other base representations with the same digit product.at n=15A331565
• a(n) = Sum_{k=1..n} (k/gcd(n, k))^3.at n=18A343513
• Numbers k such that k-1 is a perfect square and k+1 is prime.at n=17A392249