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!)
A140358 Smallest nonnegative integer k such that n = +-1+-2+-...+-k for some choice of +'s and -'s. 3

%I #62 Mar 18 2021 08:34:47

%S 0,1,3,2,3,5,3,5,4,5,4,5,7,5,7,5,7,6,7,6,7,6,7,9,7,9,7,9,7,9,8,9,8,9,

%T 8,9,8,9,11,9,11,9,11,9,11,9,11,10,11,10,11,10,11,10,11,10,11,13,11,

%U 13,11,13,11,13,11,13,11,13,12,13,12,13,12,13,12,13,12,13,12,13,15,13,15,13

%N Smallest nonnegative integer k such that n = +-1+-2+-...+-k for some choice of +'s and -'s.

%H Alois P. Heinz, <a href="/A140358/b140358.txt">Table of n, a(n) for n = 0..20000</a>

%H Rishi Advani, <a href="https://math.stackexchange.com/a/3998466/134481">Formula for sequence on Mathematics Stack Exchange</a>

%F Conjecture when n is greater than 0. Choose k so that t(k)<=n<t(k+1) where t(n) is the n-th triangular number t(n)=n(n+1)/2. If n=t(k), a(n)=k, otherwise if k is odd then a(n)=k+2 if n-t(k) is odd, a(n)=k+1 if n-t(k) is even, else if k is even than a(n)=k+1 if n-t(k) is odd, a(n)=k+3 if n-t(k) is even. (This has been verified for n up to 100.)

%F a(n) = a(-n) for all n in Z. - _Seiichi Manyama_, Aug 18 2020

%F Let k be the least integer such that t(k) >= n. If t(k) and n have the same parity then a(n) = k. Otherwise a(n) is equal to the least odd integer greater than k. - _Rishi Advani_, Jan 24 2021

%e From _Seiichi Manyama_, Aug 18 2020: (Start)

%e Illustration of initial terms:

%e 0 = 0 (empty sum).

%e 1 = 1.

%e 2 = 1 - 2 + 3.

%e 3 = 1 + 2.

%e 4 = -1 + 2 + 3.

%e 5 = 1 + 2 + 3 + 4 - 5.

%e 6 = 1 + 2 + 3.

%e 7 = 1 + 2 + 3 - 4 + 5.

%e 8 = -1 + 2 + 3 + 4.

%e 9 = 1 + 2 - 3 + 4 + 5.

%e 10 = 1 + 2 + 3 + 4.

%e ... (End)

%p b:= proc(n,i) option remember;

%p (n=0 and i=0) or n<=i*(i+1)/2 and (b(abs(n-i), i-1) or b(n+i, i-1))

%p end:

%p a:= proc(n) local k;

%p for k from 0 while not b(n,k) do od; k

%p end:

%p seq(a(n), n=0..100); # _Alois P. Heinz_, Oct 19 2011

%t b[n_, i_] := b[n, i] = (n==0 && i==0) || Abs[n] <= i(i+1)/2 && (b[n-i, i-1] || b[n+i, i-1]);

%t a[n_] := Module[{k}, For[k = 0, !b[n, k], k++]; k];

%t a /@ Range[0, 100] (* _Jean-François Alcover_, Nov 15 2020, after _Alois P. Heinz_ *)

%Y Cf. A000217, A197702, A231015, A327467.

%K nonn,look

%O 0,3

%A _John W. Layman_, Jun 23 2008

%E a(0)=3 prepended by _Seiichi Manyama_, Aug 17 2020

%E Edited and a(0)=0 from _Alois P. Heinz_, Aug 18 2020

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 July 11 12:40 EDT 2024. Contains 374232 sequences. (Running on oeis4.)