A080092 Irregular triangle read by rows, giving prime sequences (p-1|2n) appearing in the n-th von Staudt-Clausen sum.
2, 2, 3, 2, 3, 5, 2, 3, 7, 2, 3, 5, 2, 3, 11, 2, 3, 5, 7, 13, 2, 3, 2, 3, 5, 17, 2, 3, 7, 19, 2, 3, 5, 11, 2, 3, 23, 2, 3, 5, 7, 13, 2, 3, 2, 3, 5, 29, 2, 3, 7, 11, 31, 2, 3, 5, 17, 2, 3, 2, 3, 5, 7, 13, 19, 37, 2, 3, 2, 3, 5, 11, 41, 2, 3, 7, 43, 2, 3, 5, 23, 2, 3, 47, 2, 3, 5, 7, 13, 17, 2, 3
Offset: 1
Examples
First few rows of the triangle: 2; 2, 3; 2, 3, 5; 2, 3, 7; 2, 3, 5; 2, 3, 11; 2, 3, 5, 7, 13; 2, 3; ... Sum for n=1 is 1/2 + 1/3, so terms are 2, 3; sum for n=2 is 1/2 + 1/3 + 1/5, so terms are 2, 3, 5; etc.
Links
- Eric Weisstein's World of Mathematics, von Staudt-Clausen Theorem.
- Wikipedia, Von Staudt-Clausen theorem.
Programs
-
Mathematica
row[n_] := Select[ Prime /@ Range[n+1], Divisible[2n, # - 1] &]; Flatten[Table[row[n], {n, 0, 25}]] (* Jean-François Alcover, Oct 12 2011 *)
Extensions
Edited by N. J. A. Sloane, Nov 01 2009 at the suggestion of R. J. Mathar
Comments