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 A077256 #16 Jun 03 2025 03:28:01
%S A077256 3,7,11,13,19,29,37,43,53,61,71,89,103,131,151,173,181,223,229,239,
%T A077256 251,281,311,349,359,409,433,503,541,571,593,601,619,659,661,683,691,
%U A077256 701,719,769,827,857,911,941,953,997,1069,1087,1091,1129,1163,1223,1291
%N A077256 Primes p such that p^k == 1 modulo k, where p=prime(k).
%H A077256 Robert Israel, <a href="/A077256/b077256.txt">Table of n, a(n) for n = 1..10000</a>
%F A077256 A077254(A049084(a(n))) = 1.
%F A077256 a(n) = A000040(A077255(n)).
%p A077256 g:= proc(t) local p; p:= ithprime(t); if p&^ t mod t = 1 then p else NULL fi end proc:
%p A077256 map(g, [$1..1000]); # _Robert Israel_, Oct 31 2016
%t A077256 With[{no=250}, Transpose[Select[Partition[Riffle[Prime[Range[no]], Range[no]],2], PowerMod[First[#],Last[#],Last[#]]==1&]][[1]]] (* _Harvey P. Dale_, Jan 05 2011 *)
%t A077256 Prime[Select[Range[250], PowerMod[Prime[#],#,#]==1&]]
%Y A077256 Cf. A000040, A049084, A077254, A077255.
%Y A077256 Contains A048891.
%K A077256 nonn
%O A077256 1,1
%A A077256 _Reinhard Zumkeller_, Oct 31 2002