login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136808 Numbers k such that k and k^2 use only the digits 0, 1 and 2. 13

%I #39 Apr 12 2024 09:51:26

%S 0,1,10,11,100,101,110,1000,1001,1010,1011,1100,1101,10000,10001,

%T 10010,10011,10100,10110,11000,11001,11010,100000,100001,100010,

%U 100011,100100,100101,100110,101000,101001,101100,110000,110001,110010,110100,1000000,1000001,1000010,1000011,1000100

%N Numbers k such that k and k^2 use only the digits 0, 1 and 2.

%C Generated with DrScheme.

%C Subsequence of A136809, A136816, ..., A136836. - _M. F. Hasler_, Jan 24 2008

%C A278038(18) = 10101, A136827(294) = 10110001101, A136831(1276) = 101100010001101 resp. A136836(1262) = 101090009991101 are the first terms from where on these four sequences differ from the present one. - _M. F. Hasler_, Nov 15 2017

%H Giovanni Resta, <a href="/A136808/b136808.txt">Table of n, a(n) for n = 1..10000</a> (first 1359 terms from Jonathan Wellons)

%H J. Wellons, <a href="https://web.archive.org/web/20090206165028/http://jonathanwellons.com/shared-digits/">Tables of Shared Digits</a> [archived]

%H <a href="/index/Sq#squares">OEIS Index to sequences related to squares</a>.

%e 101000100100001^2 = 10201020220210222010200200001.

%p isA136808 := proc(n) local ndgs,n2dgs ; ndgs := convert(convert(n,base,10),set) ; n2dgs := convert(convert(n^2,base,10),set) ; if ( (ndgs union n2dgs) minus {0,1,2} ) = {} then true ; else false ; fi ; end: LtonRev := proc(L) local i ; add(op(i,L)*10^(i-1),i=1..nops(L)) ; end: A007089 := proc(n) convert(n,base,3) ; LtonRev(%) ; end: n := 1: for i from 0 do n3 := A007089(i) ; if isA136808(n3) then printf("%d %d ",n,n3) ; n := n+1 ; fi ; od: # _R. J. Mathar_, Jan 24 2008

%t Select[FromDigits/@Tuples[{0,1},7],Union[Take[DigitCount[#^2],{3,9}]]=={0}&] (* _Harvey P. Dale_, May 29 2013 *)

%o (PARI) for(n=1,999,vecmax(digits((N=fromdigits(binary(n),10))^2))<3 && print1(N",")) \\ _M. F. Hasler_, Nov 15 2017

%Y Cf. A136809, A136810, ..., A137147 for other digit combinations.

%Y See also A058412 = A058411^2: squares having only digits {0,1,2}, A277946 = A277959^2 = squares whose largest digit is 2.

%Y Subsequence of A278038 (binary numbers without '111'), in turn a subsequence of the binary numbers A007088.

%K nonn,base,changed

%O 1,3

%A Jonathan Wellons (wellons(AT)gmail.com), Jan 22 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)