The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A295042 Numbers k such that both k and (k+1) are abundant, and neither is divisible by 3. 1
 55959128224, 68972878975, 91653987424, 171967420624, 350441716624, 372944997424, 386136575824, 711480344575, 769856312224, 789255692224, 818564922175, 997039218175, 1071710665024, 1216042052224, 1340586071824, 1925671372624, 1954925637664, 2045947528624 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Subsequence of A096399. All terms are of the form 3j+1, with j = 18653042741, 22990959658, 30551329141, 57322473541, 116813905541, 124314999141, 128712191941, 237160114858, 256618770741, 263085230741, 272854974058, 332346406058, ... LINKS Giovanni Resta, Table of n, a(n) for n = 1..87 (terms < 10^13) MATHEMATICA abQ[n_] := Mod[n, 3] > 0 && DivisorSigma[1, n] > 2 n; abQ1[n_] := abQ[n - 1]; abQ2[n_] := abQ[n + 1]; s = Import["b115414.txt", "Data"][[All, -1]]; s1 = Select[s, abQ1] - 1; s2 = Select[s, abQ2]; seq = Union[s1, s2] (* using the b-File from A115414 *) PROG (PARI) isoka(n) = (n%3) && (sigma(n) > 2*n); isok(n) = isoka(n) && isoka(n+1); \\ Michel Marcus, Nov 13 2017 CROSSREFS Cf. A005101, A096399, A115414. Sequence in context: A034654 A233553 A273928 * A320880 A015401 A273930 Adjacent sequences:  A295039 A295040 A295041 * A295043 A295044 A295045 KEYWORD nonn AUTHOR Amiram Eldar, Nov 13 2017 EXTENSIONS a(13)-a(18) from Giovanni Resta, Aug 22 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 00:33 EST 2020. Contains 338920 sequences. (Running on oeis4.)