65500

Appears in sequences

• For a number k of length L, let f(k) be the sum of the products of the first i digits of k multiplied by the last L-i digits, for i from 1 to L-1, e.g., f(1234) = 1*234 + 12*34 + 123*4 = 1134. Sequence gives k such that f(k) = k.at n=11A065759
• Smallest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.at n=20A126783
• Monotonic ordering of nonnegative differences 4^i-6^j, for 40>= i>=0, j>=0.at n=30A192163
• Number of length n+4 0..6 arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=2A247402
• T(n,k)=Number of length n+4 0..k arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=30A247404
• Number of length 3+4 0..n arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=5A247407
• Partition the j digits of n into blocks of k, with 1 <= k <= j-1, starting at right and multiply. Sum of these numbers equals n.at n=11A275170
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 97", based on the 5-celled von Neumann neighborhood.at n=15A278866
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=15A281287
• Maximum number of simple graphs with no isolated vertices on n nodes with identical degree sequences.at n=8A308522