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.

A076535 a(n) = A064405 (2^m+n) - 2^m (for m large enough this difference appears to be constant).

This page as a plain text file.
%I A076535 #15 Feb 17 2016 16:20:01
%S A076535 -3,-6,-5,-12,-3,-10,-9,-24,1,-6,-5,-20,-3,-18,-17,-48,9,2,3,-12,5,
%T A076535 -10,-9,-40,9,-6,-5,-36,-3,-34,-33,-96,25,18,19,4,21,6,7,-24,25,10,11,
%U A076535 -20,13,-18,-17,-80,33,18,19,-12,21,-10,-9,-72,25,-6,-5,-68,-3,-66,-65,-192,57,50,51,36,53,38,39,8,57,42,43,12,45,14,15
%N A076535 a(n) = A064405 (2^m+n) - 2^m (for m large enough this difference appears to be constant).
%F A076535 a(n) = n + 1 - 4*A001316(n). a(0) = -3, a(2n) = a(n) + n, a(2n+1) = 2a(n). - _Ralf Stephan_, Oct 08 2003
%e A076535 For n=17; for m=1,2,3,4,5,6,7,8,9,10 values of A064405 (2^m+17) - 2^m are .... 2,2,2,10,2,2,2,2,2,2, so for n>4 the difference seems always equal to 2, hence a(17)=2
%o A076535 (PARI) A001316(n)=sum(k=0,n,binomial(n,k)%2)
%o A076535 for(n=0,100,print1(n+1-4*A001316(n),",")) \\ Lambert Klasen
%Y A076535 Cf. A064405.
%K A076535 sign
%O A076535 0,1
%A A076535 _Benoit Cloitre_, Oct 18 2002
%E A076535 More terms from Lambert Klasen (lambert.klasen(AT)gmx.de), Jan 14 2005