22718

Appears in sequences

• Numbers k such that 3*R_k - 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=24A055557
• Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.at n=31A074789
• Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).at n=51A109191
• Number of binary sequences of length n having a conjugate at Hamming distance 2.at n=36A179674
• The sum over all bitstrings b of length n of the number of runs in b not immediately followed by a longer run.at n=11A208902
• Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=36A244661
• Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=0A263195
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=0A263198
• Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=0A263236
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=0A263238
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 110", based on the 5-celled von Neumann neighborhood.at n=42A270170
• Number of nX4 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A299330
• Number of nX6 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A299332
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=39A299334
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=41A299334
• a(n) = tribonacci(n) modulo Fibonacci(n).at n=22A335534