login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A014741
Numbers k such that k divides 2^(k+1) - 2.
13
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
OFFSET
1,2
COMMENTS
Also, numbers k such that k divides Eulerian number A000295(k+1) = 2^(k+1) - k - 2.
Also, numbers k such that k divides A086787(k) = Sum_{i=1..k} Sum_{j=1..k} i^j.
All terms greater than 1 are even; for a proof, see comment in A036236. - Max Alekseyev, Feb 03 2012
If k>1 is a term, then 3*k is also a term. - Alexander Adamchuk, Nov 03 2006
Prime numbers of the form a(m)+1 are given by A069051. - Max Alekseyev, Nov 14 2012
The number 2^m - 2 is a term of this sequence if and only if m - 1 is a term. - Thomas Ordowski, Jul 01 2024
LINKS
FORMULA
For n > 1, a(n) = 2*A014945(n-1). - Max Alekseyev, Nov 14 2012
MATHEMATICA
Join[{1, 2}, Select[Range[17000], PowerMod[2, #+1, #]==2&]] (* Harvey P. Dale, Feb 11 2015 *)
PROG
(PARI) is(n)=Mod(2, n)^(n+1)==2 \\ Charles R Greathouse IV, Nov 03 2016
CROSSREFS
KEYWORD
nonn
STATUS
approved