This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A191291 The number of bases >=2 in which n is 3-digit number. 2
 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,16 LINKS FORMULA a(n) = floor(sqrt(n))-floor(n^(1/3)) = A000196(n) - A048766(n). PROG (PARI) a(n)=sqrtint(n)-floor((n+.5)^(1/3)) \\ Charles R Greathouse IV, Jan 03 2013 CROSSREFS Cf. A191279. Sequence in context: A074908 A256707 A151963 * A131841 A230261 A242306 Adjacent sequences:  A191288 A191289 A191290 * A191292 A191293 A191294 KEYWORD nonn,easy,base AUTHOR Vladimir Shevelev, May 29 2011 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.