cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A067863 Numbers k such that k divides the sum of digits of 7^k.

Original entry on oeis.org

1, 13, 67, 94, 139, 220, 805
Offset: 1

Views

Author

Keywords

Comments

There are no other terms < 3000. - Stefan Steinerberger, Mar 14 2006
No more terms < 50000. - David Wasserman, May 30 2008
From Jon E. Schoenfield, May 29 2010: (Start)
No more terms < 100000. It is nearly certain that no terms exist beyond 805.
Let f(k) be the sum of digits of 7^k. Let d be the number of digits, i.e., d=ceiling(log_10(7^k)).
Let s(m) be the sum of m random digits (each drawn independently from a uniform distribution over the integers 0 through 9).
As k increases, the behavior of f(k)/k becomes increasingly similar to that of s(d)/k.
The mean and variance of s(d)/k are 4.5*d/k and 28.5*d/k^2, respectively.
For large values of k, the distribution of s(d)/k approaches a standard normal distribution with mean 4.5*log_10(7) (approximately 3.80294) and variance 28.5*log_10(7)/k.
The probability P(k) that s(d)/k departs from the mean by an amount at least sufficient to reach the nearest higher or lower integer (so that k divides the sum of digits) becomes vanishingly small (e.g., P(50000) < 10^-18, P(100000) < 10^-36, P(150000) < 10^-54), and the same is true of the sum of P(i) for all i >= k (this sum is less than 10^-33 at k=100000). (End)

Examples

			13 divides the sum of digits of 7^13 (i.e., 9 + 6 + 8 + 8 + 9 + 0 + 1 + 0 + 4 + 0 + 7 = 52), so 13 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    For[n = 1, n < 2000, n++, a := DigitCount[7^n]; If[IntegerQ[Sum[a[[i]]*i, {i, 1, 9}]/n], Print[n]]] (* Stefan Steinerberger, Mar 14 2006 *)
    Select[Range[1000],Mod[Total[IntegerDigits[7^#]],#]==0&] (* Harvey P. Dale, Sep 22 2024 *)

Extensions

Edited by Jon E. Schoenfield, May 29 2010

A220365 a(n) is conjectured to be the largest power k for which k divides the sum of digits of n^k.

Original entry on oeis.org

1, 70, 486, 35, 10, 90, 805, 5218, 243, 1, 35, 1494, 469004, 1045, 288, 116, 7, 195, 29, 70, 16710, 23, 2, 1017, 28, 58, 162, 166, 209, 486, 205, 106, 1206, 2053, 37120
Offset: 1

Views

Author

Robert G. Wilson v, Dec 12 2012

Keywords

Comments

a(36) >= 423378.
Please consult the argument in A067863 for the reason that it is believed that all individual such sequences (all k's which divide b^k) terminate.

Examples

			a(2) = 70 since the sum of digits of 2^70 is divisible by 70 and it is believed that there does not exist any larger exponent which satisfies this criterion.
		

Crossrefs

Numbers n such that n divides the sum of digits of k^n: A175169 (k=2), A067862 (k=3), A067864 (k=6), A067863 (k=7), A062933 (k=8), A062927 (k=9), A175525 (k=13), A175589 (k=21), A220364 (k=36), A175552 (k=167).

Programs

  • Mathematica
    For any individual base, b, fQ[n_] := Mod[Plus @@ IntegerDigits[b^n], n] == 0; k = 1; lst = {}; While[k < 100001, If[ fQ@ k, AppendTo[lst, k]; Print[k]]; k++]; lst

Formula

If a(n) = k, then a(10*n) = k.

Extensions

Definition and example corrected by Giovanni Resta, Dec 14 2012
Showing 1-2 of 2 results.