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”).

A317044
Numbers k such that A(k+1) = A(k) + 1, where A() = A005100() are the deficient numbers.
3
1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 17, 18, 20, 21, 24, 25, 26, 27, 29, 30, 33, 34, 35, 36, 38, 39, 40, 41, 44, 45, 47, 48, 49, 50, 52, 53, 56, 57, 58, 59, 62, 63, 65, 66, 69, 70, 71, 72, 74, 75, 79, 80, 82, 83, 86, 87, 88, 89, 91, 92, 93, 94, 96, 97, 98
OFFSET
1,2
LINKS
FORMULA
Sequence is { k | A005100(k+1) = A005101(k) + 1 }.
Sequence is { k | A125238(k) = 1 }.
MAPLE
with(numtheory): A:=select(k->sigma(k)<2*k, [$1..150]):
a:=select(j->A[j+1]=A[j]+1, [$1..nops(A)-1]);
MATHEMATICA
Position[Differences[Select[Range[130], DivisorSigma[1, #] < 2*# &]], 1] // Flatten (* Amiram Eldar, Mar 15 2024 *)
PROG
(GAP) A:=Filtered([1..150], k->Sigma(k)<2*k);; a:=Filtered([1..Length(A)-1], i->A[i+1]=A[i]+1);
CROSSREFS
A317047 is the main sequence for this entry.
Numbers k such that A(k+1) = A(k) + j, where A() = A005100() are the deficient numbers: this sequence (j=1), A317045 (j=2), A317046 (j=3).
Sequence in context: A236860 A031942 A043090 * A267302 A023799 A267306
KEYWORD
nonn
AUTHOR
Muniru A Asiru, Aug 04 2018
STATUS
approved