a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).
A127014
a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).
Terms
- a(0) =1a(1) =3a(2) =3a(3) =3a(4) =19a(5) =51a(6) =115a(7) =115a(8) =115a(9) =627a(10) =627a(11) =2675a(12) =2675a(13) =2675a(14) =2675a(15) =35443a(16) =35443a(17) =166515a(18) =166515a(19) =166515a(20) =1215091a(21) =3312243a(22) =3312243a(23) =3312243a(24) =3312243a(25) =36866675
External references
- oeis: A127014