This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133219 Smallest composite integer in base n which remains composite after altering any one or two digits. 1
 1010100, 2200100, 20130000, 3243003420, 55111253530, 5411665056000, 33254100107730, 210324811482600, 977731833235239280 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Changing the most significant digit to 0 is allowed. The problem (base 10) was posed by W. Sierpinski, published in 1977. There are an infinite number of solutions if a certain Erdos conjecture on congruences is true. a(2) through a(9) are proved minimal, a(10) has not yet been proved minimal. LINKS Witold Jarnicki and Maciej Zenczykowski, On a property of the number 977731833235239280. EXAMPLE a(3) base 10 = 1953. a(4) base 10 = 34560. a(5) base 10 = 7000485. a(6) base 10 = 354748446. a(7) base 10 = 77478704205. a(8) base 10 = 1878528135128. a(9) base 10 = 48398467146642. CROSSREFS Cf. A220289. Sequence in context: A234035 A066354 A220289 * A306515 A306517 A043643 Adjacent sequences:  A133216 A133217 A133218 * A133220 A133221 A133222 KEYWORD base,more,nonn AUTHOR Jonathan Vos Post, Oct 11 2007 EXTENSIONS a(2) and the definition were corrected by Witold Jarnicki, Oct 11 2007 STATUS approved

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

Last modified December 6 18:03 EST 2019. Contains 329809 sequences. (Running on oeis4.)