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.

Showing 1-2 of 2 results.

A318303 a(0) = 0, a(n) = n + a(n-1) if n is odd, a(n) = -3*a(n/2) if n is even.

Original entry on oeis.org

0, 1, -3, 0, 9, 14, 0, 7, -27, -18, -42, -31, 0, 13, -21, -6, 81, 98, 54, 73, 126, 147, 93, 116, 0, 25, -39, -12, 63, 92, 18, 49, -243, -210, -294, -259, -162, -125, -219, -180, -378, -337, -441, -398, -279, -234, -348, -301, 0, 49, -75, -24, 117, 170, 36, 91, -189, -132, -276, -217, -54, 7, -147, -84, 729, 794, 630
Offset: 0

Views

Author

Altug Alkan, Aug 24 2018

Keywords

Comments

Let g_k(0) = 0. g_k(n) = n + g_k(n-1) if n is odd, g_k(n) = k*a(n/2) if n is even. A228451(n) is g_1(n), A298011(n) is g_2(n). This sequence is a(n) = g_k(n) where k = -3.

Crossrefs

Programs

  • Mathematica
    Nest[Append[#1, If[OddQ@ #2, #2 + #1[[-1]], -3 #1[[#2/2 + 1]] ]] & @@ {#, Length@ #} &, {0}, 66] (* Michael De Vlieger, Aug 25 2018 *)
  • PARI
    a(n)=if(n==0, 0, if(n%2, n+a(n-1), -3*a(n/2)));

A262303 Length of sequence of lower halves of n: repeatedly apply x->floor(x/2) starting at n; a(n) = number of steps until reach one of 2,3,4.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 2

Views

Author

N. J. A. Sloane, Sep 30 2015

Keywords

Examples

			20->10->5->2 takes 3 steps, so a(20)=3.
		

Crossrefs

Cf. A262304.

Extensions

a(31)-a(88) from Hiroaki Yamanouchi, Oct 03 2015
Showing 1-2 of 2 results.