23579

Appears in sequences

• Smallest number m with nonzero digits such that A046810(m)=n.at n=33A046813
• a(n) is the least integer that has exactly n anagrams that are primes.at n=33A046890
• a(n) is the least number with exactly n permutations of digits that are primes.at n=33A046893
• Number of partitions of n with designated summands.at n=25A077285
• Number of primitive normal polynomials of degree n over GF(2).at n=20A107222
• a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's.at n=45A108564
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, -1, 0), (1, 1, -1), (1, 1, 1)}.at n=8A149717
• Number of partitions p of n that include (min(p) + max(p))/2 as a part.at n=47A238480
• Odd squarefree numbers n > 1 such that lambda(n)^2 = phi(n), where lambda is the Carmichael lambda function and phi is Euler's totient function.at n=22A276980
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 150", based on the 5-celled von Neumann neighborhood.at n=17A279249
• a(n) = a(n-1) + a(n-2) + a([n/3]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=21A298340
• Maximally idempotent integers with three or more factors.at n=36A306812
• a(n) is the smallest k such that (Z/kZ)* contains C_(2n) X C_(2n) as a subgroup, where (Z/kZ)* is the multiplicative group of integers modulo n.at n=35A307436