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 A046733 #11 Apr 20 2021 22:57:45 %S A046733 1,1,13,1,31,1,16,1,13,1,110,1,56,1,403,1,96,1,120,1,208,1,553,1,31,1, %T A046733 1,1,140,1,331,1,1430,1,496,1,469,1,728,1,560,1,308,1,403,1,46,1,112, %U A046733 1,1248,1,52,1,3410,1,1560,1,3541,1,620,1,208,1,1736,1 %N A046733 Periods for divisibility of A000213 by n. %C A046733 If a(n) > 1, then n divides A000213(t + k * a(n)) for some specific value of t and all nonnegative integers k. a(n)=1, n > 1, implies there is no solution. - _Sean A. Irvine_, Apr 19 2021 %F A046733 a(2*n) = 1. - _Sean A. Irvine_, Apr 19 2021 %F A046733 More generally, a(k*m) = 1 for m in A046735 and all k >= 1. - _Sean A. Irvine_, Apr 19 2021 %Y A046733 Cf. A000213. %K A046733 nonn %O A046733 1,3 %A A046733 _David W. Wilson_ %E A046733 a(25) corrected by _Sean A. Irvine_, Apr 19 2021