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 A127071 #10 Sep 08 2022 08:45:29
%S A127071 2,6,42,294,15918,122010,7588770,61144062,4092816966,2366546223930,
%T A127071 19924878993558,12169831579784970,889585223857256850,
%U A127071 7633882758103350126,565719451451489679414,365721616201373974378410
%N A127071 Quotients (3^p - 2^p - 1)/p, where p = prime(n).
%C A127071 Prime p divides 3^p - 2^p - 1. 42 = 2*3*7 divides a(n) for n>2.
%C A127071 Numbers n such that n divides 3^n - 2^n - 1 are listed in A127072.
%C A127071 Pseudoprimes in A127072 include all powers of primes {2,3,7} and some composite numbers that are listed in A127073.
%C A127071 Numbers n such that n^2 divides 3^n - 2^n - 1 are listed in A127074.
%C A127071 Numbers n such that n^3 divides 3^n - 2^n - 1 are {1,4,7,...}.
%H A127071 G. C. Greubel, <a href="/A127071/b127071.txt">Table of n, a(n) for n = 1..315</a>
%F A127071 a(n) = (3^prime(n) - 2^prime(n) - 1)/prime(n).
%p A127071 seq((3^ithprime(n) -2^ithprime(n) -1)/(ithprime(n)), n=1..20); # _G. C. Greubel_, Aug 11 2019
%t A127071 Table[(3^Prime[n]-2^Prime[n]-1)/Prime[n],{n,1,20}]
%o A127071 (PARI) vector(20, n, p=prime; (3^p(n) - 2^p(n) -1)/p(n) ) \\ _G. C. Greubel_, Aug 11 2019
%o A127071 (Magma) p:=NthPrime; [(3^p(n) -2^p(n) -1)/p(n): n in [1..20]]; // _G. C. Greubel_, Aug 11 2019
%o A127071 (Sage) p=nth_prime; [(3^p(n) -2^p(n) -1)/p(n) for n in (1..20)] # _G. C. Greubel_, Aug 11 2019
%Y A127071 Cf. A127072, A127073, A127074.
%K A127071 nonn
%O A127071 1,1
%A A127071 _Alexander Adamchuk_, Jan 04 2007