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 A063381 #8 Nov 29 2022 01:34:42 %S A063381 1,2,9,7,24,24,56,34,151,62,173,187,264,151,530,218,679,528,737,405, %T A063381 1558,638,1256,1002,1871,852,3567,1053,2472,2109,2908,2226,5433,1840, %U A063381 4113,3523,6356,2537,9598,2944,7311,6424,7429,3883,13592,5058,11576,7982,12123,5638,17971,8613,16766,11201 %N A063381 Number of orbits of the group of units of Z/(n) acting naturally on the 4-subsets of Z/(n). %e A063381 a(5) = 2 since when U(5) = {1,2,3,4} acts naturally on the five 4-subsets {0,1,2,3}, {0,1,2,4}, {0,1,3,4}, {0,2,3,4}, {1,2,3,4} of Z/(5) the orbits are {{0,1,2,3},{0,1,2,4}, {0,1,3,4}, {0,2,3,4}} and {{1,2,3,4}}. %p A063381 g:= proc(n) local U, S, C, R,u,s,Cr,us,v; %p A063381 U:= select(t -> igcd(n,t)=1, [$1..n-1]); %p A063381 S:= combinat:-choose({$0..n-1},4); %p A063381 C:= S; %p A063381 for s in S do R[s]:= s od; %p A063381 for u in U do %p A063381 Cr:= NULL; %p A063381 for s in C do %p A063381 us:= map(t -> u*t mod n, s); %p A063381 v:= R[us]; %p A063381 while R[v] <> v do v:= R[v] od; %p A063381 if v <> s then R[s]:= v; Cr:= Cr, s fi %p A063381 od; %p A063381 C:= C minus {Cr}; %p A063381 od; %p A063381 nops(C) %p A063381 end proc; %p A063381 map(g, [$4..60]); # _Robert Israel_, Nov 28 2022 %Y A063381 Cf. A063379, A065957, A000005, A056376 + 1, A056371 - 1 %K A063381 nonn %O A063381 4,2 %A A063381 _W. Edwin Clark_, Jul 15 2001 %E A063381 Offset corrected, and more terms by _Robert Israel_, Nov 28 2022