22444

Appears in sequences

• Sort then Add, a(1)=29.at n=15A033904
• Slowest increasing and self-describing sequence: first 2 digits are prime digits, followed by 3 composite digits, then 4 prime digits, then 6 composite digits, then 8 prime, then 2 composite, then 2 prime, etc.at n=33A105808
• Expansion of g.f. (1+x-2*x^2+x^3+x^4)/((1-x)^2*(1+x)^2*(1+2*x)^2).at n=14A106691
• a(n) = prime(x) - pi(x) where x is the least x such that (prime(x+1) - pi(x+1)) - (prime(x) - pi(x)) = n.at n=34A111183
• Numbers k such that k * Fibonacci(k) + 1 is prime.at n=41A134313
• Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=26A141029
• Number of planar n X n X n binary triangular grids with mirror symmetry about one altitude with no more than 1 one in any 4 X 4 X 4 subtriangle.at n=15A153903
• a(n) = 4*(5*n^2 - 5*n + 1).at n=33A193448
• L.g.f.: Sum_{n>=1} a(n)*x^n/n = Sum_{n>=1} x^n/n * exp( Sum_{k>=1} 3*a(n*k)*x^(n*k)/k ).at n=5A203267
• Number of 3 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal.at n=30A224134
• Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=8A259945
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=36A259952
• Numbers with digits 2 and 4 only.at n=37A284920
• Positive integers with digits in nondescending order whose digit product is an integer power of their digit sum, given power > 1.at n=6A379834