A035383 -id:A035383 - cp's OEIS frontend

A003226 Automorphic numbers: m^2 ends with m.

0, 1, 5, 6, 25, 76, 376, 625, 9376, 90625, 109376, 890625, 2890625, 7109376, 12890625, 87109376, 212890625, 787109376, 1787109376, 8212890625, 18212890625, 81787109376, 918212890625, 9918212890625, 40081787109376, 59918212890625, 259918212890625, 740081787109376

Offset: 1

N. J. A. Sloane

Also called curious numbers.
For entries after the second, two successive terms sum up to a total having the form 10^n + 1. - Lekraj Beedassy, Apr 29 2005 [This comment is clearly wrong as stated. The sums of two consecutive terms are 1, 6, 11, 31, 101, 452, 1001, 10001, 100001, 200001, 1000001, 3781250, .... - T. D. Noe, Nov 14 2010]
If a d-digit number n is in the sequence, then so is 10^d+1-n. However, the same number can be 10^d+1-n for different n in the sequence (e.g., 10^3+1-376 = 10^4+1-9376 = 625), which spoils Beedassy's comment. - Robert Israel, Jun 19 2015
Substring of both its square and its cube not congruent to 0 (mod 10). See A029943. - Robert G. Wilson v, Jul 16 2005
a(n)^k ends with a(n) for k > 0; see also A029943. - Reinhard Zumkeller, Nov 26 2011
Apart from initial term, a subsequence of A046831. - M. F. Hasler, Dec 05 2012
This is also the sequence of numbers such that the n-th m-gonal number ends in n for any m == 0,4,8,16 (mod 20). - Robert Dawson, Jul 09 2018
Apart from 6, a subsequence of A301912. - Robert Dawson, Aug 01 2018

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 76, p. 26, Ellipses, Paris 2008.
V. deGuerre and R. A. Fairbairn, Automorphic numbers, J. Rec. Math., 1 (No. 3, 1968), 173-179.
R. A. Fairbairn, More on automorphic numbers, J. Rec. Math., 2 (No. 3, 1969), 170-174.
Jan Gullberg, Mathematics, From the Birth of Numbers, W. W. Norton & Co., NY, page 253-254.
B. A. Naik, 'Automorphic numbers' in 'Science Today'(subsequently renamed '2001') May 1982 pp. 59, Times of India, Mumbai.
Ya. I. Perelman, Algebra can be fun, pp. 97-98.
Clifford A. Pickover, A Passion for Mathematics, John Wiley & Sons, Hoboken, 2005, p. 64.
C. P. Schut, Idempotents. Report AM-R9101, Centrum voor Wiskunde en Informatica, Amsterdam, 1991.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Chai Wah Wu, Table of n, a(n) for n = 1..1786 (terms n = 1..200 from Vincenzo Librandi)
Robert Dawson, On Some Sequences Related to Sums of Powers, J. Int. Seq., Vol. 21 (2018), Article 18.7.6.
R. A. Fairbairn, More on automorphic numbers, J. Rec. Math., 2.3 (1969), 170-174. (Annotated scanned copy)
V. deGuerre & R. A. Fairbairn, Automorphic numbers, J. Rec. Math., 1.3 (1968), 173-179
M. Beeler, R. W. Gosper, and R. Schroeppel, HAKMEM. MIT AI Memo 239, Feb 29 1972 (Item 59 provides a 40-digit member of this sequence).
Shyam Sunder Gupta, Elegance of Squares, Cubes, and Higher Powers, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 2, 29-81.
W. Schneider, Automorphic Numbers
C. P. Schut, Idempotents, Report AM-R9101, Centre for Mathematics and Computer Science, Amsterdam, 1991. (Annotated scanned copy)
Eric Weisstein's World of Mathematics, Automorphic Number
Wikipedia, Automorphic number
Xiaolong Ron Yu, Curious Numbers, Pi Mu Epsilon Journal, Spring 1999, pp. 819-823.
Index entries for sequences related to automorphic numbers

Cf. A008851, A018247, A018248, A018834, A033819, A035383, A046831, A052228.

import Data.List (isSuffixOf)
a003226 n = a003226_list !! (n-1)
a003226_list = filter (\x -> show x `isSuffixOf` show (x^2)) a008851_list
-- Reinhard Zumkeller, Jul 27 2011

[n: n in [0..10^7] | Intseq(n^2)[1..#Intseq(n)] eq Intseq(n)]; // Vincenzo Librandi, Jul 03 2015

V:= proc(m) option remember;
  select(t -> t^2 - t mod 10^m = 0, map(s -> seq(10^(m-1)*j+s, j=0..9), V(m-1)))
end proc:
V(0):= {0,1}:
V(1):= {5,6}:
sort(map(op,[V(0),seq(V(i) minus V(i-1),i=1..50)])); # Robert Israel, Jun 19 2015

f[k_] := (r = Reduce[0 < 10^k < n < 10^(k + 1) && n^2 == m*10^(k + 1) + n, {n, m}, Integers]; If[Head[r] === And, n /. ToRules[r], n /. {ToRules[r]}]); Flatten[ Join[{0, 1}, Table[f[k], {k, 0, 13}]]] (* Jean-François Alcover, Dec 01 2011 *)
Union@ Join[{1}, Array[PowerMod[5, 2^#, 10^#] &, 16, 0], Array[PowerMod[16, 5^#, 10^#] &, 16, 0]] (* Robert G. Wilson v, Jul 23 2018 *)

is_A003226(n)={n<2 || 10^valuation(n^2-n,10)>n} \\ M. F. Hasler, Dec 05 2012

A003226(n)={ n<3 & return(n-1); my(i=10,j=10,b=5,c=6,a=b); for( k=4,n, while(b<=a, b=b^2%i*=10); while(c<=a, c=(2-c)*c%j*=10); a=min(b,c)); a } \\ M. F. Hasler, Dec 06 2012

from itertools import count, islice
from sympy.ntheory.modular import crt
def A003226_gen(): # generator of terms
    a = 0
    yield from (0,1)
    for n in count(0):
        b = sorted((int(crt(m:=(1< a:
            yield from b
            a = b[1]
        elif b[1] > a:
            yield b[1]
            a = b[1]
A003226_list = list(islice(A003226_gen(),15)) # Chai Wah Wu, Jul 25 2022

def automorphic(maxdigits, pow, base=10) :
    morphs = [[0]]
    for i in range(maxdigits):
        T=[d*base^i+x for x in morphs[-1] for d in range(base)]
        morphs.append([x for x in T if x^pow % base^(i+1) == x])
    res = list(set(sum(morphs, []))); res.sort()
    return res
# call with pow=2 for this sequence, Eric M. Schmidt, Feb 09 2014

Equals {0, 1} union A007185 union A016090.

More terms from Michel ten Voorde, Apr 11 2001
Edited by David W. Wilson, Sep 26 2002
Incorrect statement removed from title by Robert Dawson, Jul 09 2018

A113627 a(n) is the smallest number k such that k and 2^k have the same last n digits. Here k may have fewer than n digits and can be padded with leading zeros (cf. A121319).

Original entry on oeis.org

14, 36, 736, 8736, 48736, 948736, 2948736, 32948736, 432948736, 3432948736, 53432948736, 353432948736, 5353432948736, 75353432948736, 75353432948736, 5075353432948736, 15075353432948736, 615075353432948736, 8615075353432948736, 98615075353432948736, 98615075353432948736

Offset: 1

Jon E. Schoenfield, Apr 23 2007

			2^14 = 16384 and 14 end with the same single digit 4, thus a(1) = 14.

Jon E. Schoenfield, Table of n, a(n) for n = 1..81

See A121319, the main entry for this sequence, for further information.
Same as A109405 except for the initial term (14). - Max Alekseyev, May 11 2007
Cf. A007185, A016090, A003226, A035383, A064540, A064541, A109405, A121319, A206636.

A121319 a(n) is the smallest number k such that k and 2^k have the same last n digits. Here k must have at least n digits (cf. A113627).

Original entry on oeis.org

14, 36, 736, 8736, 48736, 948736, 2948736, 32948736, 432948736, 3432948736, 53432948736, 353432948736, 5353432948736, 75353432948736, 1075353432948736, 5075353432948736, 15075353432948736, 615075353432948736, 8615075353432948736, 98615075353432948736

Offset: 1

Tanya Khovanova, Aug 25 2006

			2^14 = 16384 and 14 end with the same single digit 4, thus a(1) = 14.

Jon E. Schoenfield, Table of n, a(n) for n = 1..80
Jon E. Schoenfield, Excel program

Cf. A007185, A016090, A003226, A035383, A064540, A064541, A109405.

f[n_] := Block[{k = If[n == 1, 2, 10], m = 10^n}, While[ PowerMod[2, k, m] != Mod[k, m], k += 2]; k]; Do[ Print@f@n, {n, 9}] (* Robert G. Wilson v *)

A121319(n) = { local(k,tn); tn=10^n ; forstep(k=2,1000000000,2, if ( k % tn == (2^k) % tn, return(k) ; ) ; ) ; return(0) ; } { for(n = 1,13, print( A121319(n)) ; ) ; } \\ R. J. Mathar, Aug 27 2006

If A109405(n) has n digits, a(n) = A109405(n), otherwise a(n) = A109405(n) + 10^n. - Max Alekseyev, May 05 2007

a(6)-a(9) from Robert G. Wilson v and Jon E. Schoenfield, Aug 26 2006
a(10) from Robert G. Wilson v, Sep 26 2006
a(11)-a(16) from Alexander Adamchuk, Jan 28 2007
a(16) corrected by Max Alekseyev, Apr 12 2007

A185999 Automorphic semiprimes: semiprimes, sp, such that sp is the k-th semiprime and sp ends in k.

Original entry on oeis.org

291, 24502749, 36627829, 3547310731, 4721984179, 461808766011

Offset: 1

Jonathan Vos Post & Robert G. Wilson v, Feb 24 2011

Analogy, this sequence is to semiprimes (A001358) as A046883 is to the primes (A000040) or as A035383 is to the squares (A000290) among many others.

Index entries for sequences related to automorphic numbers

Cf. A001358, A046883, A046883, A186000.

nextSemiPrime[n_] := Block[{k = n + 1}, While[ Plus @@ Last /@ FactorInteger@ k != 2, k++]; k]; c = 1; k = 4; lst = {}; While[k < 8100000000, If[ Mod[k, 10^Floor[1 + Log10@ c]] == c, AppendTo[lst, k]; Print[{c, k}]]; c++; k = nextSemiPrime@ k]; lst
These terms can be crosschecked by: SemiPrimePi[n_] := Sum[ PrimePi[n/Prime@ i] -i + 1, {i, PrimePi@ Sqrt@ n}]

a(6) from Donovan Johnson, Mar 03 2011

A161783 Squares n^2 whose decimal expansion contains n as a substring.

Original entry on oeis.org

1, 25, 36, 100, 625, 2500, 3600, 5776, 10000, 62500, 141376, 250000, 360000, 390625, 577600, 1000000, 6250000, 14137600, 14379264, 25000000, 36000000, 39062500, 57760000, 87909376, 100000000, 214651801, 625000000, 1413760000, 2500000000

Offset: 1

Claudio Meller, Jun 19 2009

14379264 is in the list because 14379264 = 3792^2 and 3792 is a substring of 14379264.

			1 contains its square root (1); 25 contains its square root (5); 3600 contains -- but does not end with -- its square root (60). - _Dominick Cancilla_, Jul 20 2010

Equals A018834^2. Cf. A035383.

fQ[n_] := StringPosition[ IntegerString[n^2], IntegerString@n] != {}; lst = {}; k = 1; While[k < 50001, If[ fQ@k, AppendTo[lst, k^2]]; k++ ]; lst (* Robert G. Wilson v, Jul 23 2010 *)

Edited by N. J. A. Sloane, Jul 23 2010

cp's OEIS Frontend

A003226 Automorphic numbers: m^2 ends with m.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Sage

Formula

Extensions

A113627 a(n) is the smallest number k such that k and 2^k have the same last n digits. Here k may have fewer than n digits and can be padded with leading zeros (cf. A121319).

Views

Author

Keywords

Examples

Links

Crossrefs

A121319 a(n) is the smallest number k such that k and 2^k have the same last n digits. Here k must have at least n digits (cf. A113627).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A185999 Automorphic semiprimes: semiprimes, sp, such that sp is the k-th semiprime and sp ends in k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A161783 Squares n^2 whose decimal expansion contains n as a substring.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions