A028689 -id:A028689 - cp's OEIS frontend

A028691 Least positive value of k for which the n-th sorted Galois number divides k!.

1, 2, 3, 5, 4, 7, 11, 13, 17, 19, 9, 23, 29, 31, 37, 8, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 15, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257

Offset: 1

Olivier Gérard

nonn

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Cf. A028689.

Offset set to 1 by Alois P. Heinz, Nov 07 2018

A280187 Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.

Original entry on oeis.org

6, 20, 110, 272, 506, 812, 2162, 2756, 3422, 4970, 6806, 7832, 11342, 12656, 17030, 18632, 22052, 27722, 29756, 31862, 36290, 38612, 51302, 54056, 56882, 62750, 65792, 68906, 72092, 85556, 96410, 100172, 120062, 124256, 128522

Offset: 1

Charles R Greathouse IV, Dec 28 2016

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..4000

Primitive elements of A228870.

Subsequence of A002943. Also a subsequence of A028689, A036689, A053198, A068377, A079143, A128672, A220211 and other sequences ...- Paolo P. Lava, Jan 10 2017

has(n)=my(f=factor(n)[,1]); for(i=1,#f, if(n%(f[i]-1)==0 && f[i]>2, return(1))); 0
is(n)=if(n%2, return(0)); if(n%3==0, return(n==6)); if(n%20==0, return(n==20)); if(!has(n), return(0)); my(f=factor(n)[,1]); for(i=1,#f, if(has(n/f[i]), return(0))); 1 \\ Charles R Greathouse IV, Dec 28 2016

A028690 Sorted Galois and Pseudo-Galois numbers.

Original entry on oeis.org

1, 2, 6, 12, 20, 24, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 432, 462, 506, 552, 600, 650, 702, 756, 812, 870, 930, 992, 1056, 1122, 1190, 1260, 1332, 1344, 1406, 1482, 1560, 1640, 1722, 1806, 1892, 1980, 2070, 2162, 2256, 2352

Offset: 1

Olivier Gérard

nonn

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Cf. A028665, A028667, A028668, ..., A028689, A028691.

Offset changed to 1 by Alois P. Heinz, Nov 07 2018

cp's OEIS Frontend

A028691 Least positive value of k for which the n-th sorted Galois number divides k!.

Views

Author

Keywords

Links

Crossrefs

Extensions

A280187 Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A028690 Sorted Galois and Pseudo-Galois numbers.

Views

Author

Keywords

Links

Crossrefs

Extensions