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-4 of 4 results.

A124359 Numbers n for which the sum of the digits of n^k, for some k, is equal to n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 18, 20, 22, 25, 26, 27, 28, 31, 34, 35, 36, 40, 43, 45, 46, 53, 54, 58, 63, 64, 68, 71, 80, 81, 82, 85, 86, 90, 91, 94, 97, 98, 103, 104, 106, 107, 108, 117, 118, 126, 127, 133, 134, 135, 136, 140, 142, 143, 146, 152, 154, 155, 157, 160, 163, 169, 170
Offset: 1

Views

Author

Keywords

Comments

Most of the values are conjectural. So far not much is proved about the function A247889. - M. F. Hasler and Robert Israel, May 18 2017

Examples

			18^3 = 5832 and 5 + 8 + 3 + 2 = 18 (also 18^6 = 34012224 and 18^7 = 612220032).
Again 46^5 = 205962976 and 2 + 0 + 5 + 9 + 6 + 2 + 9 + 7 + 6 = 46.
		

Crossrefs

Complement of A124367. Numbers for which A247889 is nonzero.

Programs

Extensions

Prepended a(1) = 0, offset corrected and more terms added by Derek Orr, Sep 25 2014
Edited by M. F. Hasler, May 18 2017

A124367 Numbers that raised to any exponent do not produce a number whose sum of digits is equal to the initial number.

Original entry on oeis.org

10, 11, 12, 13, 14, 15, 16, 19, 21, 23, 24, 29, 30, 32, 33, 37, 38, 39, 41, 42, 44, 47, 48, 49, 50, 51, 52, 55, 56, 57, 59, 60, 61, 62, 65, 66, 67, 69, 70, 72, 73, 74, 75, 76, 77, 78, 79, 83, 84, 87, 88, 89, 92, 93, 95, 96, 99, 100, 101, 102, 105
Offset: 1

Views

Author

Keywords

Comments

Complement of A124359. Numbers for which A247889 is zero.
Most of the values are conjectural, so far not much is really proved about the function A247889. - M. F. Hasler and Robert Israel, May 18 2017

Crossrefs

Programs

Extensions

106 removed by Robert Israel, May 18 2017

A286512 Numbers N for which there is k > 0 such that sum of digits(N^k) = N, but the least such k is larger than the least k for which sum of digits(N^k) > N*11/10.

Original entry on oeis.org

17, 31, 63, 86, 91, 103, 118, 133, 155, 157, 211, 270, 290, 301, 338, 352, 421, 432, 440, 441, 450, 478, 513, 533, 693, 853, 1051, 1237, 1363, 1459, 1526, 1665, 2781
Offset: 1

Views

Author

M. F. Hasler, May 18 2017

Keywords

Comments

The set of these numbers appears to be finite, and probably 2781 is its largest element.
The motivation for this sequence is the study of the behavior of the sum of digits of powers of a given number. Statistically, sumdigits(n^k) ~ 4.5*log_10(n')*k (where n' = n without trailing 0's), but typically fluctuations of some percent persist up to large values of k. (Cf. the graph of sequences n^k cited in the cross-references.)
The ratio of 11/10 is somewhat arbitrary, but larger ratios of the simple form (1 + 1/m) yield quite small subsets of this sequence (for m=2 the only element is 118, for m=3 the set is {31, 86, 118}, for m=1 it is empty), and smaller ratios yield much larger (possibly infinite?) sets. Also, the condition can be written sumdigits(N^k)-N > N/10, and 10 is the base we are using.
To compute the sequence A247889 we would like to have a rule telling us when we can stop the search for an exponent. It appears that sumdigits(N^k) >= 2*N is a limit that works for all N; the present sequence gives counterexamples to the (r.h.s.) limit of 1.1*N. The above comment mentioned the counterexamples {118} resp. {31, 86, 118}) for limits N*3/2 and N*4/3.

Crossrefs

Cf. sum of digits of k^n: A001370 (k=2), A004166 (k=3), A065713 (k=4), A066001 (k=5), A066002 (k=6), A066003 (k=7), A066004 (k=8), A065999 (k=9), A066005 (k=11), A066006 (k=12). (In these sequences, k is fixed and n is the index/exponent; in the present sequence it's the opposite and therefore the names k <-> n are exchanged.)

Programs

  • PARI
    for(n=1,5000,A247889(n)&&!A247889(n,n*11\10)&&print1(n",")) \\ Here, A247889() is a variant of the function computing that sequence which accepts as second optional argument a limit m, stopping the search for the exponent as soon as the digital sum of n^k exceeds m.

A287058 Sum of decimal digits of 118^n.

Original entry on oeis.org

1, 10, 19, 19, 55, 64, 55, 64, 82, 91, 109, 100, 109, 181, 118, 145, 127, 163, 154, 172, 154, 190, 226, 190, 208, 217, 271, 289, 253, 280, 298, 307, 334, 289, 334, 280, 361, 343, 334, 379, 406, 406, 379, 424, 379, 424, 415, 406, 523, 433, 478
Offset: 0

Views

Author

M. F. Hasler, May 18 2017

Keywords

Comments

118 is exceptional in the sense that it appears to be the only number m for which the smallest k such that sumdigits(m^k) = m occurs after the smallest k such that sumdigits(m^k) > m*3/2. If this last limit is decreased to m*4/3, then 31 and 86 also have this property. It appears that no number has this property if the limit is increased to 2m, see also A247889.
It is also remarkable that many values in the sequence are repeated (19, 55, 64, 109, 190, 154, 280, 289, 334 (3 times), 379, 406, 424, ...), while most other numbers never appear.

Crossrefs

Cf. sum of digits of k^n: A001370 (k=2), A004166 (k=3), A065713 (k=4), A066001(k=5), A066002 (k=6), A066003 (k=7), A066004 (k=8), A065999 (k=9), A066005 (k=11), A066006 (k=12).

Programs

  • Mathematica
    Total[IntegerDigits[#]]&/@NestList[118#&,1,50] (* Harvey P. Dale, Feb 24 2022 *)
  • PARI
    a(n)=sumdigits(118^n)
Showing 1-4 of 4 results.