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.

A362966 Numbers k such that A007908(k) == 1 (mod k).

This page as a plain text file.
%I A362966 #17 Oct 12 2024 09:02:14
%S A362966 1,121487,293957,13449179,549999887
%N A362966 Numbers k such that A007908(k) == 1 (mod k).
%C A362966 a(6) > 10^11. - _Jason Yuen_, Oct 12 2024
%o A362966 (Python) # See A029455 for concat_mod
%o A362966 def isok(k): return concat_mod(10, k, k)==1%k # _Jason Yuen_, Oct 12 2024
%Y A362966 Cf. A007908, A029455, A029479, A110740.
%K A362966 nonn,base,hard,more
%O A362966 1,2
%A A362966 _Max Alekseyev_, Jun 06 2023