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 A178195 #7 Dec 06 2014 15:38:19
%S A178195 1,3,1154,31,5,29,7,39297,13,19055,18,23,22,21,535,19,20,62537,1138,
%T A178195 45,142,2092793,42,19547,25,39279,50,749,36,39055,1126,39,188,93641,
%U A178195 35,634815079,70,171,86,355,52,65387,713,69,148,253,74
%N A178195 Smallest k such that 34^k mod k = n.
%C A178195 First unknown term is a(47), where there are no solutions < 2904290724.
%C A178195 For a catalog of sequences of the kind "smallest k such that m^k mod k = n," see A178194.
%t A178195 aa = {}; Do[k = 1; While[PowerMod[34, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 50}]; aa
%Y A178195 Cf. A036236, A078457, A119678, A119679, A119714-A119716, A127817-A127821, A128154-A128372, A178194-A178202.
%K A178195 nonn
%O A178195 0,2
%A A178195 _Artur Jasinski_, May 23 2010