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.

A178197 Smallest k such that 36^k mod k = n.

This page as a plain text file.
%I A178197 #14 Jul 22 2025 08:10:48
%S A178197 1,5,17,11,34,31,10,29,14,213,13,1585,39,23,1282,21,20,19,142,
%T A178197 56413361,22,445,26,169,87,341,50,33,332,33607,57,55329163,158,46623,
%U A178197 1262,33763,37,167987937385549,74,123,284,12091,51,119,626,531,2630,960641,104,473,98,75,116,424381,174,7751,62,951,781,364789,206,545,1234,93,77,205591,78,51367,614,159,1226,623,207,23147,94,11847,100,3551,161,332089,176,99,143,361841,202,73969,590,129,302
%N A178197 Smallest k such that 36^k mod k = n.
%t A178197 aa = {}; Do[k = 1; While[PowerMod[36, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 50}]; aa
%Y A178197 Cf. A036236, A078457, A119678, A119679, A119714-A119716, A127817-A127821, A128154-A128372, A178194-A178202.
%K A178197 nonn
%O A178197 0,2
%A A178197 _Artur Jasinski_, May 23 2010
%E A178197 Terms a(37) onward from _Max Alekseyev_, May 07 2012