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 A177813 #9 Jun 06 2021 06:31:36
%S A177813 1,7,203,11977,154553,353423,3049963,4482037,5192537,7170569,9904979,
%T A177813 20851957,33461911,35852033,69262991,88448927,160274303,264440183,
%U A177813 306359683,381231473,423063571,978466699,1974252749,2115269947,4647954787,5218486693,6824905927,7803226417,9040206917,10041409007,11055712717,12483960629,17244568439,47773414171,57280493557,57729535241,58257187051,62418389453,67340133077
%N A177813 Numbers k such that k^3 divides 13^(k^2) + 1.
%C A177813 7 divides a(n) for n > 1.
%C A177813 Prime factors of a(n) in the order of their appearance are {7, 29, 59, 22079, 1741, 435709, 25579, 35323, 827, 164837, 176611, 5783, 435709, 22896329, 54461639, 4820033, ...}. - _Alexander Adamchuk_, May 16 2010
%Y A177813 Cf. A127263 (k^3 divides 2^(k^2) + 1).
%Y A177813 Cf. A128678, A128679, A128680, A128681, A128682, A128683, A128684, A128685.
%Y A177813 Cf. A177813, A177814, A177816, A177817, A177818, A177819, A177820.
%Y A177813 Cf. A128677 (least k > p such that (k*p)^3 divides (p-1)^(k*p)^2+1, where p = prime(n) > 2).
%K A177813 nonn
%O A177813 1,2
%A A177813 _Alexander Adamchuk_, May 14 2010
%E A177813 Corrected and extended by _Max Alekseyev_, May 16 2010
%E A177813 a(8) = 4482037 (suggested by _Max Alekseyev_) missing in original sequence inserted by _Alexander Adamchuk_, May 16 2010
%E A177813 More terms from _Max Alekseyev_, Feb 14 2012