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!)
A071623 Least k such that n = A071532(k). 1

%I #6 Mar 30 2012 18:39:02

%S 1,4,5,6,7,8,15,18,21,22,35,64,65,130,131,160,161,170,175,186,187,190,

%T 391,392,393,508,511,514,515,516,519,530,535,536,539,540,543,552,553,

%U 566,577,584,587,588,593,594,627,630,631,636

%N Least k such that n = A071532(k).

%C For some n, a(n+1)-a(n)=1.

%o (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 Cf. A071532.

%K easy,nonn

%O 1,2

%A _Benoit Cloitre_, Jun 22 2002

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)