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

A048973
Complement of A005243.
4
4, 7, 9, 12, 13, 15, 20, 23, 26, 27, 28, 31, 36, 38, 39, 42, 44, 48, 50, 52, 53, 55, 56, 61, 63, 64, 66, 74, 79, 83, 85, 89, 98, 101, 103, 107, 109, 114, 120, 123, 125, 128, 131, 133, 136, 144, 152, 157, 159, 160, 165, 168, 182, 184, 190, 192, 198, 203, 208, 212
OFFSET
1,1
COMMENTS
The sequence appears to be growing slightly faster than quadratically. - T. D. Noe, Nov 04 2007
LINKS
T. D. Noe, Table of n, a(n) for n=1..6564 (terms < 10^8)
MATHEMATICA
nmax = 250; For[ s = {1, 2}; n = 3, n <= nmax, n++, ls = Length[s]; tt = Total /@ Flatten[Table[s[[i ;; j]], {i, 1, ls - 1}, {j, i + 1, ls}], 1]; If[MemberQ[tt, n], AppendTo[s, n]]]; A048973 = Complement[Range[nmax], s] (* Jean-François Alcover, Oct 21 2016 *)
PROG
(Haskell)
import Data.List.Ordered (minus)
a048973 n = a048973_list !! (n-1)
a048973_list = [1..] `minus` a005243_list
-- Reinhard Zumkeller, Dec 17 2015
CROSSREFS
Sequence in context: A074341 A362185 A085922 * A092861 A248561 A360925
KEYWORD
nonn,easy,nice
AUTHOR
D. R. Hofstadter
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Oct 02 2000
STATUS
approved