58618

Appears in sequences

• Numbers k such that k | 6^k + 6.at n=15A015892
• Numbers k such that k | 7^k + 7.at n=34A015893
• 5th-order digital invariants: the sum of the 5th powers of the digits of n equals some number k and the sum of the 5th powers of the digits of k equals n.at n=4A072896
• Least n-th order digital invariant which is not an Armstrong number (A005188), or 0 if no such term exists.at n=2A072897
• Let n = d_1 d_2 ... d_k in base 10 and f(n) = Sum_{i=1..k} d_i^k; sequence gives numbers n such that n != f(n) but n = f(f(n)).at n=4A101335
• Number of 0's in the binary expansion of A127962(n).at n=32A127964
• Numbers appearing in the cycles of the "Recurring Digital Invariant Variant" problem described in A151543.at n=43A151544
• Base-10 pseudo-altruistic numbers.at n=26A157714
• Recurring digital invariants of order 5.at n=7A218246
• Maximum fixed points under iteration of sum of cubes of digits in base n.at n=40A226026
• Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 2 3 4 5 6 7 8 9 or 10.at n=2A251517
• Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock summing to 2 3 4 5 6 7 8 9 or 10.at n=0A251519
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 2 3 4 5 6 7 8 9 or 10.at n=3A251524
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 2 3 4 5 6 7 8 9 or 10.at n=5A251524
• Amicable digital pairs: The smaller number of a pair (x,y) with x <> y such that, in decimal notation and with an appropriate number of leading zeros prepended, x=(x_m...x_1x_0)_{10}, y=(y_m...y_1y_0)_{10}, x = y_m^m + ... + y_1^m + y_0^m, and y = x_m^m + ... + x_1^m + x_0^m.at n=3A262091
• Amicable digital pairs: A262091 and A262092 interleaved.at n=6A262615
• Amicable digital numbers.at n=6A264951
• Amicable digital pair: the pairs from A262615 ordered by their smallest member.at n=6A264958
• Least integer k such that k/2^n > sqrt(1/5).at n=17A293335