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!)
A220136 Number of ways that a number n can be written as ddd...d where d is a digit in base b with 1 < b < n-1. 17

%I #19 Apr 15 2017 09:48:53

%S 0,0,0,0,0,0,1,1,0,1,0,1,1,1,2,1,0,2,0,1,2,1,0,3,0,2,1,2,0,2,2,2,1,1,

%T 1,3,0,1,1,4,0,3,1,2,2,1,0,4,0,2,1,2,0,3,1,2,2,1,0,5,0,2,4,2,1,3,0,2,

%U 1,3,0,4,1,1,2,2,1,3,0,5,1,1,0,5,2,2,1

%N Number of ways that a number n can be written as ddd...d where d is a digit in base b with 1 < b < n-1.

%C When a(n) > 0, n is called Brazilian (A125134). The first number having exactly k representations is A284758(k) for k >= 0 or A066460(k+1) for k > 0. - _Bernard Schott_, Apr 08 2017

%H T. D. Noe, <a href="/A220136/b220136.txt">Table of n, a(n) for n = 1..10000</a>

%t brazBases[n_] := Select[Range[2, n - 2], Length[Union[IntegerDigits[n, #]]] == 1 &]; Table[Length[brazBases[n]], {n, 100}]

%o (PARI) a(n) = sum(i=2, n-2, #vecsort(digits(n,i), , 8)==1) \\ _David A. Corneth_, Apr 08 2017

%Y Cf. A066460, A125134, A284758.

%K nonn

%O 1,15

%A _T. D. Noe_, Dec 26 2012

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 18 14:46 EDT 2024. Contains 371780 sequences. (Running on oeis4.)