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!)
A284882 Positions of -1 in A284881. 5

%I #9 Jun 25 2017 10:46:29

%S 2,5,8,11,15,18,20,23,26,29,33,36,38,41,45,48,50,53,56,59,62,65,69,72,

%T 74,77,80,83,87,90,92,95,99,102,104,107,110,113,116,119,123,126,128,

%U 131,135,138,140,143,146,149,152,155,159,162,164,167,170,173,177

%N Positions of -1 in A284881.

%C This sequence and A284883 and A284884 form a partition of the positive integers. For n>=1, we have 3n-a(n) in {0,1}, 3*n+1-A284883(n) in {0,1,2,3}, and 3*n-1-A284884(n) in {0,1,2}.

%C A284881 = (1,-1,1,0,-1,0,1,-1,1,0,-1,0,1,0,...); thus

%C A284882 = (2,5,8,11,15,18,...)

%C A284883 = (4,6,10,12,14,16,...)

%C A284884 = (1,3,7,9,13,17,...).

%H Clark Kimberling, <a href="/A284882/b284882.txt">Table of n, a(n) for n = 1..10000</a>

%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0, 1, 1, 0}}] &, {0}, 6] (* A284878 *)

%t d = Differences[s] (* A284881 *)

%t Flatten[Position[d, -1]] (* A284882 *)

%t d2 = Flatten[Position[d, 0]] (* A284883 *)

%t Flatten[Position[d, 1]] (* A284884 *)

%t d2/2 (* A284885 *)

%Y Cf. A284793, A284881, A284883, A284884.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Apr 16 2017

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 March 29 09:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)