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!)
A309202 Peter Munn showed in A111273 that if A111273(n)=m then if m is odd, n <= m, and if m is even, n <= 2*m-1; a(n) is either m-n or 2*m-1-n in the two cases. 1

%I

%S 0,1,0,1,10,1,0,3,0,1,32,1,78,7,0,1,34,1,0,7,12,1,0,15,0,1,8,1,58,1,0,

%T 15,154,1,24,1,666,1,12,1,82,1,128,1,24,1,140,7,0,25,16,1,106,1,32,19,

%U 0,1,176,1,1830,1,0,15,0,1,200,23,36,1,0,1,2628,37,24,1,66,1,236,27,0,1,0,55,0,43

%N Peter Munn showed in A111273 that if A111273(n)=m then if m is odd, n <= m, and if m is even, n <= 2*m-1; a(n) is either m-n or 2*m-1-n in the two cases.

%C It is known that if p is an odd prime, a(p-1) = 1 (see A111273).

%Y Cf. A111273.

%K nonn

%O 1,5

%A _N. J. A. Sloane_, Jul 26 2019

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 May 28 09:09 EDT 2022. Contains 354112 sequences. (Running on oeis4.)