login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284884 Positions of 1 in A284881. 4
1, 3, 7, 9, 13, 17, 19, 21, 25, 27, 31, 35, 37, 39, 43, 47, 49, 51, 55, 57, 61, 63, 67, 71, 73, 75, 79, 81, 85, 89, 91, 93, 97, 101, 103, 105, 109, 111, 115, 117, 121, 125, 127, 129, 133, 137, 139, 141, 145, 147, 151, 153, 157, 161, 163, 165, 169, 171, 175 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This sequence and A284882 and A284883 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}.

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

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

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

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

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

MATHEMATICA

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

d = Differences[s]  (* A284881 *)

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

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

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

d2/2  (* A284885 *)

CROSSREFS

Cf. A284793, A284881, A284882, A284883.

Sequence in context: A285353 A063204 A236208 * A130568 A143803 A284894

Adjacent sequences:  A284881 A284882 A284883 * A284885 A284886 A284887

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 16 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 05:56 EDT 2019. Contains 328335 sequences. (Running on oeis4.)