[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A303028 a(0) = 0, a(1) = a(2) = 1; for k >= 2, a(2*k-1) = k - 1 - a(k-1) - a(k), a(2*k) = a(2*k-1) - a(k). 3

%I #29 Dec 13 2019 23:34:12

%S 0,1,1,-1,-2,2,3,6,8,4,2,0,-3,-3,-9,-7,-15,-4,-8,3,1,8,8,14,17,18,21,

%T 25,34,30,37,37,52,35,39,29,37,23,20,15,14,11,3,5,-3,0,-14,-8,-25,-11,

%U -29,-14,-35,-20,-45,-32,-66,-36,-66,-38,-75,-44,-81,-58,-110,-55,-90,-41,-80,-34,-63,-31,-68,-24,-47,-6,-26,3

%N a(0) = 0, a(1) = a(2) = 1; for k >= 2, a(2*k-1) = k - 1 - a(k-1) - a(k), a(2*k) = a(2*k-1) - a(k).

%H Altug Alkan, <a href="/A303028/b303028.txt">Table of n, a(n) for n = 0..11000</a>

%H Altug Alkan, <a href="/A303028/a303028.png">A scatterplot of first differences of a(n)</a>

%H Rémy Sigrist, <a href="/A303028/a303028_1.png">Density plot of the first 11000000 terms</a>

%o (PARI) a = vector(77); print1 (0", "); for (k=1, #a, print1 (a[k]=if (k<=2, 1, my (n=k\2); if (k%2==0, a[2*n-1]-a[n], n-a[n]-a[n+1]))", ")) \\ _Rémy Sigrist_, Aug 16 2018

%Y Cf. A002487, A330328 (first differences).

%K sign,look,hear

%O 0,5

%A _Altug Alkan_, Aug 16 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 31 05:08 EDT 2024. Contains 375550 sequences. (Running on oeis4.)