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.

A193865 a(n) = (A187108(n+1)-A187108(n))/2.

This page as a plain text file.
%I A193865 #8 Apr 16 2023 08:38:13
%S A193865 1,2,1,3,2,1,2,1,3,2,1,2,1,3,2,1,3,3,2,1,2,1,3,3,2,1,3,2,1,2,1,3,2,1,
%T A193865 2,1,3,2,1,2,1,3,2,1,2,1,3,2,1,2,1,3,2,1,3,3,2,1,2,1,3,2,1,2,1,3,3,2,
%U A193865 1,3,2,1,2,1,3,2,1,2,1,3,2,1,2,1,3,3
%N A193865 a(n) = (A187108(n+1)-A187108(n))/2.
%o A193865 (AS3)
%o A193865 var a:Array=new Array();
%o A193865 var i:int;
%o A193865 var n:int=0;
%o A193865 var ni:int;
%o A193865 var b:Array = new Array();
%o A193865 for (i=0; i<=1000; i++){
%o A193865 while(a[n]!=undefined) n++;
%o A193865 b.push(String(2*n+1));
%o A193865 a[n]=1;
%o A193865 ni=2*n+1;
%o A193865 while(ni>=2*n+1&&ni>1){
%o A193865 ni=3*ni+1;
%o A193865 while(ni%2==0)ni/=2;
%o A193865 a[(ni-1)/2]=1;
%o A193865 }}
%o A193865 for(i=0;i<1000;i++)b[i]=(b[i+1]-b[i])/2;b.pop();
%o A193865 trace(b);
%K A193865 nonn
%O A193865 1,2
%A A193865 _Jimin Park_, Aug 07 2011