22009

Appears in sequences

• Least k such that the first k terms of the Kolakoski sequence (A000002) contain n more 2's than 1's.at n=14A025503
• Numbers k such that 233*2^k+1 is prime.at n=26A032493
• Chebyshev S-sequence with Diophantine property.at n=4A077416
• Number of partitions of n into decimal repdigit numbers.at n=42A088669
• Number of partitions of n into decimal palindromes.at n=42A091580
• A transform of the Fibonacci numbers.at n=49A099505
• a(1) = a(2) = 1. a(n) = a(n-1) + (largest nonprime {1 or composite} among the first n-2 terms of the sequence).at n=24A120760
• Row sums of triangle A135858.at n=28A135859
• Partial sums of A151791.at n=39A151792
• Sequences A087800 and A077416 interleaved.at n=9A164826
• Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its three previous neighbors modulo (n+1).at n=10A200669
• Position of first appearance of each integer in A088568 (number of 1's minus number of 2's in first n terms of A000002).at n=26A288605
• a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude.at n=14A294449
• The number of distinct positions on an infinite chessboard reachable by the (2,3)-leaper (or zebra) in at most n moves.at n=26A297740
• The smallest positive number such that sopfr(|a(n) - n|) = sopfr(a(n) + n) and Omega(|a(n) - n|) = Omega(a(n) + n), where sopfr(k) is the sum of the primes dividing k, with repetition.at n=30A370504
• a(1)=1, a(2)=4, and thereafter a(n) = a(n-2) + k * a(n-1), with minimal k >= 1 such that a(n) is not prime.at n=13A374055