22560

Appears in sequences

• Convolution of A023531 and Fibonacci numbers.at n=22A023557
• Convolution of A023531 and (F(2), F(3), F(4), ...).at n=21A023561
• Number of unbranched mono-5-catapolyheptagons.at n=7A038177
• Number of invertible n X n matrices with entries equal to 0 or 1.at n=4A055165
• Triangle T(n,k) = number of rational (0,1) matrices of rank k (n >= 0, 0 <= k <= n).at n=14A064230
• Composite numbers k such that k - phi(k) divides sigma(k) - k.at n=13A068418
• Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n).at n=12A068495
• Integer quotient defining A068418 is 3.at n=5A069737
• Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d.at n=29A141586
• a(n) = 25*n^2 + 2*n.at n=29A154377
• Numbers of the form p^5*q*r*s where p, q, r, and s are distinct primes.at n=27A179704
• E.g.f. satisfies: A(A(A(x))) = d/dx A(x)^2/2 with A(0)=0, A'(0)=1.at n=4A186632
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=w+|y-z|.at n=41A212685
• Number of length n+1 0..2 X 4 arrays with the sum of the absolute values of adjacent differences equal to n*4.at n=4A249978
• T(n,k) is the number of length n+1 0..2*k arrays with the sum of the absolute values of adjacent differences equal to n*k.at n=32A249982
• Number of length 5+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 5*n.at n=3A249985
• Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 2.at n=12A257619
• Number of n-digit binary strings such that for all 2 <= k <= n, the string formed by the first k digits of the original string is composed of at least one-quarter 1's and one-quarter 0's.at n=16A268691
• Terms of A143407, sorted.at n=45A270564
• a(n) is the least strongly refactorable multiple of n if any, or a(n) = -1 otherwise.at n=46A306693