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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A335702 A sequence connected with Rado’s explicit description of the Erdős-Rényi countable random graph. 1
 0, 1, 2, 4, 5, 8, 12, 16, 17, 18, 24, 32, 34, 40, 48, 50, 56, 64, 65, 72, 80, 81, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 257, 258, 260, 261, 272, 273, 274, 288, 290, 304, 306, 320, 321, 336 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS It would be nice to have an explicit definition. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Peter J. Cameron, A Puzzle, Blog, Aug 05 2020. Peter J. Cameron, Puzzle Solution, Blog, Aug 13 2020. PROG (PARI) S(n) = { my (s=[], i); while (n, i=valuation(n, 2); s=concat(s, i); n-=2^i); s } is(n) = my (s=S(n), z=if (#s, Set(concat(apply(S, s))), [])); setintersect(s, z)==[] \\ Rémy Sigrist, Aug 14 2020 CROSSREFS Cf. A133457. Sequence in context: A035001 A260386 A092268 * A069259 A102186 A039842 Adjacent sequences:  A335699 A335700 A335701 * A335703 A335704 A335705 KEYWORD nonn AUTHOR N. J. A. Sloane, Aug 13 2020 EXTENSIONS More terms from Rémy Sigrist, Aug 14 2020 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 June 15 12:29 EDT 2021. Contains 345048 sequences. (Running on oeis4.)