cp's OEIS Frontend

A094096 Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.

%I A094096 #5 Mar 30 2012 18:50:44
%S A094096 1,5,1,494,533,133,1,361131,998130,318354,389455,275577,42778,14162,1,
%T A094096 4436526107,21759994113,223006618265,97254937860,19669357917
%N A094096 Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.
%C A094096 a(2^n - 1) = 1.
%e A094096 n=5->'101', L(5)=3, L(5)!=6, a(5)=533: (533 mod (1+1*6))*2^0 +
%e A094096 (533 mod (1+2*6))*2^1 + (533 mod (1+3*6))*2^2 = (533 mod 7)*1+ (533 mod
%e A094096 13)*2 + (533 mod 19)*4 = 1*1 + 0*2 + 1*4 = 5.
%K A094096 nonn,more
%O A094096 1,2
%A A094096 _Reinhard Zumkeller_, May 05 2004
%E A094096 Corrected and extended. _Sean A. Irvine_, Sep 17 2009