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

A068948 Primes in A068947.

Original entry on oeis.org

2, 3, 7, 13, 17, 43, 83, 167, 313, 1667, 6833, 8167, 191833, 298327, 3143167, 197222917, 994927133, 3160522105583
Offset: 1

Views

Author

Francois Jooste (phukraut(AT)hotmail.com), Mar 15 2002

Keywords

Comments

a(19) > 10^13. - Giovanni Resta, Jun 27 2018

Examples

			a(4)=13 since 13 is the fourth prime in A068947.
		

Crossrefs

Extensions

a(16)-a(17) from Sean A. Irvine, Jun 07 2011
a(18) from Giovanni Resta, Jun 27 2018

A068809 Squares with strictly increasing sum of digits.

Original entry on oeis.org

1, 4, 9, 49, 169, 289, 1849, 3969, 6889, 27889, 69696, 97969, 499849, 698896, 2778889, 4999696, 9696996, 19998784, 46689889, 66699889, 79869969, 277788889, 478996996, 876988996, 1749999889, 5599977889, 7998976969, 8998988769, 17999978896
Offset: 1

Views

Author

Amarnath Murthy, Mar 06 2002

Keywords

Crossrefs

Programs

  • Maple
    A007953 := proc(n) option remember: return add(d, d=convert(n, base, 10)): end: A068947 := proc(n) option remember: local k, p: if(n=1)then return 1: fi: k:=procname(n-1): p:=A007953(k^2): do k:=k+1: if(A007953(k^2)>p)then return k: fi: od: end: seq(A068947(n)^2, n=1..20); # Nathaniel Johnston, May 04 2011
  • Mathematica
    t = {}; s = 0; Do[If[(x = Total[IntegerDigits[y = n^2]]) > s, AppendTo[t, y]; s = x], {n, 150000}]; t (* Jayanta Basu, Aug 06 2013 *)

Extensions

More terms from Francois Jooste (phukraut(AT)hotmail.com), Mar 15 2002

A362264 Numbers > 9 with increasingly large digit average of their square, in base 10.

Original entry on oeis.org

10, 11, 12, 13, 17, 63, 83, 313, 94863, 3162083, 994927133
Offset: 0

Views

Author

M. F. Hasler, Apr 13 2023

Keywords

Comments

The single-digit number 3, whose square is 9, has the highest possible digit average, therefore this "trivial solution" is excluded. However, the sequence could be defined as "numbers > 3 ..." in which case it would start 4, 6, 7, 63, ... see examples.
It is conjectured but not known that there are only finitely many numbers whose square has a digit average above 8.3.
Can it be proved or disproved that all terms > 17 end in a digit 3?
Next terms might be 707106074079263583 (da = 8.25) and 94180040294109027313 (da = 8.275), but there might be other terms in between.

Examples

			The respective digit averages are:
   n  |    a(n)   |       a(n)^2     | #digits | sum(digits) | digit average
  ----+-----------+------------------+---------+-------------+------------------
   -  |      4    |          16      |    2    |       7     |    7/2 = 3.5
   -  |      6    |          36      |    2    |       9     |    9/2 = 4.5
   -  |      7    |          49      |    2    |      13     |   13/2 = 6.5
   0  |     10    |         100      |    3    |       1     |    1/3 = 0.333...
   1  |     11    |         121      |    3    |       4     |    4/3 = 1.333...
   2  |     12    |         144      |    3    |       9     |     3  = 3.0
   3  |     13    |         169      |    3    |      16     |   16/3 = 3.333...
   4  |     17    |         289      |    3    |      19     |   19/3 = 6.333...
   5  |     63    |        3969      |    4    |      27     |   27/4 = 6.75
   6  |     83    |        6889      |    4    |      31     |   31/4 = 7.75
   7  |    313    |       97969      |    5    |      40     |     8  = 8.0
   8  |   94863   |     8998988769   |   10    |      81     |  81/10 = 8.1
   9  |  3162083  |   9998768898889  |   13    |     106     | 106/13 = 8.15...
  10  | 994927133 |989879999979599689|   18    |     148     |   74/9 = 8.222...
		

Crossrefs

Programs

  • PARI
    m=0; for(k=10,oo, vecsum(d=digits(k^2))>m*#d && !print1(k", ") && m=vecsum(d)/#d)
Showing 1-3 of 3 results.