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.

A071623 Least k such that n = A071532(k).

This page as a plain text file.
%I A071623 #6 Mar 30 2012 18:39:02
%S A071623 1,4,5,6,7,8,15,18,21,22,35,64,65,130,131,160,161,170,175,186,187,190,
%T A071623 391,392,393,508,511,514,515,516,519,530,535,536,539,540,543,552,553,
%U A071623 566,577,584,587,588,593,594,627,630,631,636
%N A071623 Least k such that n = A071532(k).
%C A071623 For some n, a(n+1)-a(n)=1.
%o A071623 (PARI) for(n=1,50,s=1; while(abs(n+sum(i=1,s,sign((-1)^floor((3/2)^i))))>0,s++); print1(s,","))
%Y A071623 Cf. A071532.
%K A071623 easy,nonn
%O A071623 1,2
%A A071623 _Benoit Cloitre_, Jun 22 2002