This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A155886 #16 Mar 18 2024 16:05:48 %S A155886 1,3,14,11,6,1941491,10,83,31,13,123,35,71,27,34913,241,18,8059,34, %T A155886 349,44,25,39,100867561,76,231,253,66203,57,227,139,45,184,37,111,97, %U A155886 55,41,103,1099,81,66791,53 %N A155886 Least k such that 2^(2^k) = n (mod k). %C A155886 First occurrence of n in sequence A155836. %C A155886 a(43) > 12500000. - _Tyler Busby_, Mar 15 2024 %Y A155886 Cf. A015910 (2^n mod n), A036236, A155836. %K A155886 nonn,more %O A155886 0,2 %A A155886 _T. D. Noe_, Jan 29 2009