90153

Appears in sequences

• Triangle read by rows: T(n, k) = binomial(n-1, k-1)*A008292(n, k).at n=30A141686
• Triangle read by rows: T(n, k) = binomial(n-1, k-1)*A008292(n, k).at n=33A141686
• Deficient numbers whose aliquot sequence is deficient, abundant, deficient, ..., etc.at n=25A234970
• Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=6A298556
• Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=3A298559
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=48A298560
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=51A298560
• Partial sums of A299285.at n=32A299286
• Odd numbers k such that k and k+2 both have at least two divisors with the same value of the Euler totient function (A000010).at n=4A373527