login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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: A256823 A074341 A085922 * A092861 A248561 A007072

Adjacent sequences:  A048970 A048971 A048972 * A048974 A048975 A048976

KEYWORD

nonn,easy,nice

AUTHOR

D. R. Hofstadter

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Oct 02 2000

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 13 16:57 EST 2017. Contains 295959 sequences.