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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257283 Numbers n not divisible by 3 such that n^2 written in base 3 has no digit > 1. 3
 1, 2, 11, 16, 19, 29, 55, 83, 143, 163, 245, 262, 421, 451, 487, 731, 889, 1331, 1342, 1459, 1487, 2189, 2242, 2323, 2537, 2573, 2644, 2662, 3788, 4375, 4562, 6563, 6688, 6967, 7036, 7082, 7696, 8035 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The first condition is added to avoid trivial solutions of the form a(k)*3^m, whose square, written in base 3, would just have 0's appended w.r.t. a(k)^2, and thus always have the digits 1 and 0. An infinite subset of solutions is given by { 3^m+2; m>1 } U { 2*3^m+1; m>1 }. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..200 MATHEMATICA Select[Range[10000], Mod[#, 3]!=0&&Max[IntegerDigits[#^2, 3]]<2&] (* Harvey P. Dale, May 17 2018 *) PROG (PARI) b=3; for(n=1, 9999, n%b||next; vecmax(digits(n^2, b))>1||print1(n", ")) CROSSREFS Cf. A257284, A230030. Sequence in context: A297836 A241757 A272883 * A091211 A306278 A199397 Adjacent sequences: A257280 A257281 A257282 * A257284 A257285 A257286 KEYWORD nonn,base AUTHOR M. F. Hasler, May 02 2015 STATUS approved

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.

Last modified December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)