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!)
A257521 Odd Brazilian numbers. 8

%I #32 Oct 08 2016 02:31:37

%S 7,13,15,21,27,31,33,35,39,43,45,51,55,57,63,65,69,73,75,77,81,85,87,

%T 91,93,95,99,105,111,115,117,119,121,123,125,127,129,133,135,141,143,

%U 145,147,153,155,157,159,161,165,171,175,177,183,185,187,189,195

%N Odd Brazilian numbers.

%C All even integers 2p >=8 are Brazilian numbers (A125134), because 2p=2(p-1)+2 is written 22 in base p-1 if p-1>2, that is true if p >=4. But, among Brazilian numbers, there are also odd ones...

%C The only square of a prime is 121. - _Robert G. Wilson v_, May 21 2015

%H Daniel Lignon and Robert Israel, <a href="/A257521/b257521.txt">Table of n, a(n) for n = 1..10000</a> (first 703 from Daniel Lignon)

%p N:= 1000: # to get all terms <= N

%p for b from 2 to floor(N/2-1) do

%p dk:= 1 + (b mod 2);

%p for j from 1 to b-1 by 2 do

%p for k from dk by dk do

%p if j=1 and k=1 then next fi;

%p x:= j*(b^(k+1)-1)/(b-1);

%p if x > N then break fi;

%p B[x]:= 1;

%p od

%p od

%p od:

%p sort(map(op,[indices(B)])); # _Robert Israel_, May 27 2015

%t fQ[n_] := Block[{b = 2}, While[b < n - 1 && Length[ Union[ IntegerDigits[n, b]]] > 1, b++]; b < n - 1]; Select[1 + 2 Range@100, fQ] (* _Robert G. Wilson v_, May 21 2015 *)

%o (PARI) forstep(n=5, 300, 2, for(b=2, n-2, d=digits(n, b); if(vecmin(d)==vecmax(d), print1(n, ", "); break))) \\ _Derek Orr_, Apr 30 2015

%Y Cf. A125134 (Brazilian numbers), A253261 (odd Brazilian squares).

%Y Cf. A085104 (prime Brazilian numbers).

%K nonn,base,easy

%O 1,1

%A _Daniel Lignon_, Apr 27 2015

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:21 EDT 2024. Contains 371936 sequences. (Running on oeis4.)