cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A234011 The sums of 2 consecutive odious numbers (A000069).

This page as a plain text file.
%I A234011 #43 Jul 24 2023 02:36:37
%S A234011 3,6,11,15,19,24,27,30,35,40,43,47,51,54,59,63,67,72,75,79,83,86,91,
%T A234011 96,99,102,107,111,115,120,123,126,131,136,139,143,147,150,155,160,
%U A234011 163,166,171,175,179,184,187,191,195,198,203,207,211,216,219,222,227,232,235,239,243,246
%N A234011 The sums of 2 consecutive odious numbers (A000069).
%C A234011 The union of A131323(k) and (A225822(m)+(-1)^m).
%C A234011 All even numbers in this sequence are evil numbers (A001969).
%C A234011 It seems that A233388(n) = a(A091785(n)).
%H A234011 Antti Karttunen, <a href="/A234011/b234011.txt">Table of n, a(n) for n = 1..8192</a>
%F A234011 a(n) = A000069(n) + A000069(n + 1).
%F A234011 4n - 2 <= a(n) <= 4n. - _Charles R Greathouse IV_, Dec 29 2013
%F A234011 a(2n+1) = 8n + 3 = A017101(n). - _Ralf Stephan_, Dec 31 2013
%t A234011 Plus @@@ Partition[Select[Range[125], OddQ[DigitCount[#, 2][[1]]] &], 2, 1] (* _Amiram Eldar_, Jul 24 2023 *)
%o A234011 (PARI) a(n)=4*n-hammingweight(n-1)%2-hammingweight(n)%2 \\ _Charles R Greathouse IV_, Dec 29 2013
%o A234011 (Scheme) (define (A234011 n) (+ (A000069 n) (A000069 (+ n 1)))) ;; _Antti Karttunen_, Dec 29 2013
%Y A234011 Cf. A000069, A003159 (indices of odd numbers in A234011), A036554 (indices of even numbers in A234011), A131323 (odd sums of 2 successive odious or 2 successive evil numbers), A233388 (odious numbers in A234011), A234431 (sums of 2 consecutive evil numbers), A017101, A091785, A225822, A227930, A233388.
%K A234011 nonn,easy,base
%O A234011 1,1
%A A234011 _Gerasimov Sergey_, Dec 27 2013
%E A234011 Terms recomputed and checked by _Antti Karttunen_, Dec 29 2013