66198

Appears in sequences

• Giuga numbers: composite numbers n such that p divides n/p - 1 for every prime divisor p of n.at n=3A007850
• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=31A050789
• 24 'Reverse and Add' steps are needed to reach a palindrome.at n=35A065318
• Fourth right hand column of triangle A165674.at n=23A165676
• 1/4 the number of (n+1) X 9 binary arrays with all 2 X 2 subblock sums the same.at n=16A183985
• Numbers m such that (m'-1)' = m+1, where m' denotes the arithmetic derivative of m.at n=5A203617
• Number of (7+2) X (n+2) 0..1 arrays with every 3 X 3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=20A254913
• Prime power Giuga numbers: composite numbers n > 1 such that -1/n + sum 1/p^k = 1, where the sum is over the prime powers p^k dividing n.at n=12A286497
• Number of subsets of {1, 2, ..., n} such that the sum of the reciprocals is strictly less than 1.at n=19A305442
• Starts of runs of 3 consecutive Niven numbers in base 2 (A049445).at n=29A330932