|
| |
|
|
A014741
|
|
Numbers n such that n divides Eulerian number A000295(n+1) = 2^(n+1) - n - 2.
|
|
4
| |
|
|
1, 2, 6, 18, 42, 54, 126, 162, 294, 342, 378, 486, 882, 1026, 1134, 1314, 1458, 1806, 2058, 2394, 2646, 3078, 3402, 3942, 4374, 5334, 5418, 6174, 6498, 7182, 7938, 9198, 9234, 10206, 11826, 12642, 13122, 14154, 14406, 16002, 16254
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Also numbers n that divide 2^(n+1) - 2.
Also numbers n that divide A086787(n) = Sum[ i^j, {i, 1, n}, {j, 1, n}].
All terms greater than 1 are even; for a proof, see comment in A036236. [From Max Alekseyev (maxale(AT)gmail.com), Feb 03 2012]
If k>1 is a term, then 3*k is also a term. [From Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 03 2006]
|
|
|
CROSSREFS
| Cf. A000295, A086787, A015919, A006517
Sequence in context: A146345 A064842 A101695 * A016059 A027556 A195584
Adjacent sequences: A014738 A014739 A014740 * A014742 A014743 A014744
|
|
|
KEYWORD
| nonn,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Olivier Gerard (olivier.gerard(AT)gmail.com)
|
| |
|
|
