21826

Appears in sequences

• Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 22 (most significant digit on right).at n=29A029515
• XOR difference triangle of the powers of 3, read by rows.at n=46A099887
• Even composites in A145832 with at least three distinct prime factors.at n=8A145916
• Square excess of Fibonacci numbers.at n=45A190993
• Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,1,4,0 for x=0,1,2,3,4.at n=4A197163
• Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,1,4,0 for x=0,1,2,3,4.at n=3A197164
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,2,1,4,0 for x=0,1,2,3,4.at n=31A197167
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,2,1,4,0 for x=0,1,2,3,4.at n=32A197167
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero first and second differences.at n=15A200456
• Smallest distance of the n-th Fibonacci number to the set of all square integers.at n=45A243256
• Number of binary strings of length n+10 such that the smallest number whose binary representation is not visible in the string is 10.at n=8A261475
• Number of integer partitions of n that can be partitioned into a set of sets.at n=40A382077
• a(n) is the length of the disturbed prefix after n steps of the iterative process defined in the Comments.at n=45A387572
• a(n) is the length of the disturbed prefix after n steps of the iterative process defined in the Comments.at n=46A387572
• a(n) = A276086(n)*A276086(sigma(n)-n) - A276086(sigma(n)), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=23A388281