The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076827 Number of odd terms minus number of even terms in the set S(n) = ( A002977(k) : k<=n). 1
 1, 2, 1, 2, 3, 2, 3, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 10, 11, 10, 11, 12, 13, 14, 13, 14, 15, 16, 15, 16, 17, 18, 17, 18, 17, 18, 19, 20, 21, 20, 21, 20, 21, 22, 23, 24, 23, 24, 23, 24, 25, 26, 27, 26, 27, 26, 27, 28, 27, 28, 29, 28, 29, 30, 29, 30, 29, 30, 31 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 Amiram Eldar, Plot of a(n)/n for n = 1000..10000 FORMULA a(n) = (-1)*Sum_{k=1..n} (-1)^A002977(k). a(n) > 0 and a(n) seems to be asymptotic to c*n where c = 0.4... EXAMPLE S(12) = (1,3,4,7,9,10,13,15,19,21,22,27) and there are 9 odd terms and 3 even terms in S(12), hence a(12) = 9-3 = 6. MATHEMATICA seq[max_] := Module[{s = Flatten[NestWhileList[Flatten[{2*# + 1, 3*# + 1}] &, 1, Min[#1] < max &]], t}, t = Union[Select[s, # <= max &]]; FoldList[Plus, -(-1)^t]]; seq[300] (* Amiram Eldar, May 07 2022 *) CROSSREFS Cf. A002977. Sequence in context: A356999 A127255 A174832 * A165477 A318687 A119994 Adjacent sequences: A076824 A076825 A076826 * A076828 A076829 A076830 KEYWORD nonn AUTHOR Benoit Cloitre, Nov 20 2002 STATUS approved

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

Last modified November 29 07:01 EST 2022. Contains 358422 sequences. (Running on oeis4.)