265440
domain: N
Appears in sequences
- Numbers k such that phi(prime(k)-1) == 0 (mod k).at n=16A067733
- Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.at n=32A073474
- n*(n-1)*(n^2-n+4)/6.at n=36A103290
- Number of nX2 arrays containing 2 copies of 0..n-1 with no element plus any horizontal or vertical neighbor equal to n-1.at n=5A265660
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal or vertical neighbor equal to n-1.at n=26A265663