80892

Appears in sequences

• a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=14A004953
• a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=14A004973
• Amicable triples: numbers such that sigma(x) = sigma(y) = sigma(z) = x+y+z, x<y<z. We order these triples according to the common value of sigma. Sequence gives y numbers.at n=17A125491
• Numbers k such that k^4 contains every digit exactly twice.at n=3A154818
• a(n) is the number of permutations of n elements with exactly one fixed point and no transpositions.at n=8A221145
• Composite numbers such that Sum_{i=1..k} (1 + 1/p_i) - Product_{i=1..k} (1 + 1/p_i) is an integer, where p_i are the k prime factors of n (with multiplicity).at n=8A226365
• Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A299810
• Number of nX7 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299813
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=48A299814
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=51A299814
• Triangle read by rows: T(n,k) is the number of permutations of length n that have k same elements at the same positions with its inverse permutation for 0 <= k <= n.at n=46A344901