112082

Appears in sequences

• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).at n=43A058787
• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=52A058788
• Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=55A058788
• Sums of two distinct prime 4th powers.at n=20A130873
• Sum of fourth powers of two consecutive primes.at n=5A133535
• Irregular triangle read by rows: T(n,k) is the number of polyhedra with n faces and k vertices (n >= 4, k=4..2n-4).at n=59A212438
• Consider the prime factors, with multiplicity, in ascending order, of a composite number not ending in 0. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to the reverse of themselves.at n=12A247013
• Sums of two distinct odd fourth powers.at n=34A342832