This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115857 Smallest integer m > n, such that there exists nonzero solutions to a cross-domain congruence n*i = m X i, n if no such integer exists. 9

%I

%S 1,2,7,4,13,14,11,8,25,26,31,28,21,22,19,16,49,50,23,52,29,62,47,56,

%T 41,42,31,44,37,38,35,32,97,98,39,100,61,46,63,104,105,58,59,124,53,

%U 94,55,112,81,82,55,84,93,62,59,88,73,74,63,76,69,70,67,64,193,194,71,196,77

%N Smallest integer m > n, such that there exists nonzero solutions to a cross-domain congruence n*i = m X i, n if no such integer exists.

%C Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720).

%H <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a>

%Y a(2n) = 2*a(n). Bisection A115858 gives only the odd terms. Differs from A065621 for the first time at n=19, where a(19)=23, while A065621(19)=55. The next differences are a(21)=29 (A065621(21)=61) and a(23)=47 (A065621(23)=59). Cf. A115859, A115861, A115869, A115871, A115872.

%K nonn

%O 1,2

%A _Antti Karttunen_, Feb 07 2006

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

Last modified March 19 19:45 EDT 2019. Contains 321331 sequences. (Running on oeis4.)