cp's OEIS Frontend

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.

A178196 Smallest k such that 35^k mod k = n.

This page as a plain text file.
%I A178196 #9 Jul 22 2025 08:10:40
%S A178196 1,2,3,26,31,10,29,14,9,13,55,57,23,92,21,22,19,99,187,134,2105,28,
%T A178196 169,1202,593791,30,27,1198,203,46,695,66,42843,248,4023706859,37,
%U A178196 449467,132,327,1186,565,74,581,394,14277,110,59867,62,1311139,56,75
%N A178196 Smallest k such that 35^k mod k = n.
%t A178196 aa = {}; Do[k = 1; While[PowerMod[35, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 50}]; aa
%Y A178196 Cf. A036236, A078457, A119678, A119679, A119714, A119715, A119716, A127817-A127821, A128154-A128372, A178194-A178202.
%K A178196 nonn
%O A178196 0,2
%A A178196 _Artur Jasinski_, May 23 2010
%E A178196 Terms a(34) onward from _Max Alekseyev_, Feb 04 2012