|
%I M3752 #159 Jul 26 2022 01:35:23
%S 0,1,5,6,25,76,376,625,9376,90625,109376,890625,2890625,7109376,
%T 12890625,87109376,212890625,787109376,1787109376,8212890625,
%U 18212890625,81787109376,918212890625,9918212890625,40081787109376,59918212890625,259918212890625,740081787109376
%N Automorphic numbers: m^2 ends with m.
%C Also called curious numbers.
%C 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]
%C 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
%C Substring of both its square and its cube not congruent to 0 (mod 10). See A029943. - _Robert G. Wilson v_, Jul 16 2005
%C a(n)^k ends with a(n) for k > 0; see also A029943. - _Reinhard Zumkeller_, Nov 26 2011
%C Apart from initial term, a subsequence of A046831. - _M. F. Hasler_, Dec 05 2012
%C 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
%C Apart from 6, a subsequence of A301912. - _Robert Dawson_, Aug 01 2018
%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 76, p. 26, Ellipses, Paris 2008.
%D V. deGuerre and R. A. Fairbairn, Automorphic numbers, J. Rec. Math., 1 (No. 3, 1968), 173-179.
%D R. A. Fairbairn, More on automorphic numbers, J. Rec. Math., 2 (No. 3, 1969), 170-174.
%D Jan Gullberg, Mathematics, From the Birth of Numbers, W. W. Norton & Co., NY, page 253-4.
%D B. A. Naik, 'Automorphic numbers' in 'Science Today'(subsequently renamed '2001') May 1982 pp. 59, Times of India, Mumbai.
%D Ya. I. Perelman, Algebra can be fun, pp. 97-98.
%D Clifford A. Pickover, A Passion for Mathematics, John Wiley & Sons, Hoboken, 2005, p. 64.
%D C. P. Schut, Idempotents. Report AM-R9101, Centrum voor Wiskunde en Informatica, Amsterdam, 1991.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Chai Wah Wu, <a href="/A003226/b003226.txt">Table of n, a(n) for n = 1..1786</a> (terms n = 1..200 from Vincenzo Librandi)
%H Robert Dawson, <a href="https://www.emis.de/journals/JIS/VOL21/Dawson/dawson6.html">On Some Sequences Related to Sums of Powers</a>, J. Int. Seq., Vol. 21 (2018), Article 18.7.6.
%H R. A. Fairbairn, <a href="/A003226/a003226_1.pdf">More on automorphic numbers</a>, J. Rec. Math., 2.3 (1969), 170-174. (Annotated scanned copy)
%H V. deGuerre & R. A. Fairbairn, <a href="/A003226/a003226.pdf">Automorphic numbers</a>, J. Rec. Math., 1.3 (1968), 173-179
%H Beeler, M., Gosper, R. W. and Schroeppel, R., <a href="http://w3.pppl.gov/~hammett/work/2009/AIM-239-ocr.pdf">HAKMEM</a>. MIT AI Memo 239, Feb 29 1972 (Item 95 provides a 40-digit member of this sequence).
%H W. Schneider, <a href="http://web.archive.org/web/2004/www.wschnei.de/digit-related-numbers/automorphic-numbers.html">Automorphic Numbers</a>
%H C. P. Schut, <a href="/A007185/a007185.pdf">Idempotents</a>, Report AM-R9101, Centre for Mathematics and Computer Science, Amsterdam, 1991. (Annotated scanned copy)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AutomorphicNumber.html">Automorphic Number</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Automorphic_number">Automorphic number</a>
%H Xiaolong Ron Yu, <a href="http://www.pme-math.org/journal/issues/PMEJ.Vol.10.No.10.pdf">Curious Numbers</a>, Pi Mu Epsilon Journal, Spring 1999, pp. 819-823.
%H <a href="/index/Ar#automorphic">Index entries for sequences related to automorphic numbers</a>
%F Equals {0, 1} union A007185 union A016090.
%p V:= proc(m) option remember;
%p select(t -> t^2 - t mod 10^m = 0, map(s -> seq(10^(m-1)*j+s, j=0..9), V(m-1)))
%p end proc:
%p V(0):= {0,1}:
%p V(1):= {5,6}:
%p sort(map(op,[V(0),seq(V(i) minus V(i-1),i=1..50)])); # _Robert Israel_, Jun 19 2015
%t 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 *)
%t Union@ Join[{1}, Array[PowerMod[5, 2^#, 10^#] &, 16, 0], Array[PowerMod[16, 5^#, 10^#] &, 16, 0]] (* _Robert G. Wilson v_, Jul 23 2018 *)
%o (Haskell)
%o import Data.List (isSuffixOf)
%o a003226 n = a003226_list !! (n-1)
%o a003226_list = filter (\x -> show x `isSuffixOf` show (x^2)) a008851_list
%o -- _Reinhard Zumkeller_, Jul 27 2011
%o (PARI) is_A003226(n)={n<2 || 10^valuation(n^2-n,10)>n} \\ _M. F. Hasler_, Dec 05 2012
%o (PARI) 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
%o (Sage)
%o def automorphic(maxdigits, pow, base=10) :
%o morphs = [[0]]
%o for i in range(maxdigits):
%o T=[d*base^i+x for x in morphs[-1] for d in range(base)]
%o morphs.append([x for x in T if x^pow % base^(i+1) == x])
%o res = list(set(sum(morphs, []))); res.sort()
%o return res
%o # call with pow=2 for this sequence, _Eric M. Schmidt_, Feb 09 2014
%o (Magma) [n: n in [0..10^7] | Intseq(n^2)[1..#Intseq(n)] eq Intseq(n)]; // _Vincenzo Librandi_, Jul 03 2015
%o (Python)
%o from itertools import count, islice
%o from sympy.ntheory.modular import crt
%o def A003226_gen(): # generator of terms
%o a = 0
%o yield from (0,1)
%o for n in count(0):
%o b = sorted((int(crt(m:=(1<<n,5**n),(0,1))[0]), int(crt(m,(1,0))[0])))
%o if b[0] > a:
%o yield from b
%o a = b[1]
%o elif b[1] > a:
%o yield b[1]
%o a = b[1]
%o A003226_list = list(islice(A003226_gen(),15)) # _Chai Wah Wu_, Jul 25 2022
%Y Cf. A008851, A018247, A018248, A018834, A033819, A035383, A046831, A052228.
%K nonn,base,nice,easy
%O 1,3
%A _N. J. A. Sloane_
%E More terms from _Michel ten Voorde_, Apr 11 2001
%E Edited by _David W. Wilson_, Sep 26 2002
%E Incorrect statement removed from title by _Robert Dawson_, Jul 09 2018
|
