A132082 Triangle read by rows: row n contains the n smallest positive integers which are coprime to (2^n +1).

1, 1, 2, 1, 2, 4, 1, 2, 3, 4, 1, 2, 4, 5, 7, 1, 2, 3, 4, 6, 7, 1, 2, 4, 5, 7, 8, 10, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 4, 5, 7, 8, 10, 11, 13, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12

Offset

1,3

Links

Table of n, a(n) for n=1..78.

Example

2^6 + 1 = 65. So row 6 contains the 6 smallest positive integers which are coprime to 65: (1,2,3,4,6,7).
 1;
 1, 2;
 1, 2, 4;
 1, 2, 3, 4;
 1, 2, 4, 5, 7;
 1, 2, 3, 4, 6, 7;
 1, 2, 4, 5, 7, 8,10;
 1, 2, 3, 4, 5, 6, 7, 8;
 1, 2, 4, 5, 7, 8,10,11,13;
 1, 2, 3, 4, 6, 7, 8, 9,11,12;
 1, 2, 4, 5, 7, 8,10,11,13,14,16;
 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12;
 1, 2, 4, 5, 7, 8,10,11,13,14,16,17,19;
 1, 2, 3, 4, 6, 7, 8, 9,11,12,13,14,16,17;
1, 2, 4, 5, 7, 8,10,13,14,16,17,19,20,23,25; # R. J. Mathar, Feb 27 2018

Prog

(PARI) tabl(nn) = {for (n = 1, nn, m = 2^n+1; i = 1; nb = 0; while (nb != n, if (gcd(i, m) == 1, print1(i, ", "); nb++; ); i++); ); } \\ Michel Marcus, Feb 12 2014

Crossrefs

Cf. A132083, A131879.

Sequence in context: A337714 A198069 A300792 * A129644 A081517 A104778

Adjacent sequences: A132079 A132080 A132081 * A132083 A132084 A132085

Keyword

nonn,tabl

Author

Leroy Quet, Aug 09 2007

Extensions

More terms from Michel Marcus, Feb 12 2014

Status

approved