login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000696 Numbers n such that (1,n) is "good".
(Formerly M4397 N1853)
0

%I M4397 N1853

%S 1,7,31,37,109,121,127,133,151,157,403,421,511,529,631,637,661,679,

%T 1579,1621,1633,1969,1981,2017,2041,2047,2053,2071,2077,2143,2149,

%U 2167,2173,2401,2527,2557,2677,6493,6559,6643,6661,6703,6733,6871

%N Numbers n such that (1,n) is "good".

%C Let S be the set of nonnegative integers whose base 4 representation does not contain the digits 2 or 3. A pair (M,N) of nonnegative integers is called "good" if every nonnegative integer can be represented uniquely in the form M*s_1 - N*s_2 where s_1 and s_2 are in S.

%D N. G. de Bruijn, Some direct decompositions of the set of integers, Math. Comp., 18 (1964), 537-546.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%Y Cf. A000695.

%K nonn,base

%O 1,2

%A _N. J. A. Sloane_.

%E More terms from _Sean A. Irvine_, Feb 27 2011

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

Content is available under The OEIS End-User License Agreement .

Last modified November 28 11:56 EST 2014. Contains 250348 sequences.