A327176 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A327176

Positions of 1's in {A327174(n) : n > 0}.

2, 3, 6, 7, 8, 11, 15, 16, 19, 20, 21, 23, 24, 28, 29, 32, 36, 37, 40, 41, 42, 44, 45, 49, 50, 53, 54, 55, 57, 58, 61, 62, 63, 66, 70, 71, 74, 75, 76, 78, 79, 83, 84, 87, 91, 92, 95, 96, 97, 100, 104, 105, 108, 109, 110, 112, 113, 116, 117, 118, 121, 125

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Although a(n)/n->2, the sequence 2*n-a(n) appears to be unbounded below and above.

Positive integers k such that A327174(k) = 1. - Jianing Song, Sep 30 2019

LINKS

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

MATHEMATICA

r = (1 + Sqrt[5])/2; z = 200;

t = Table[Floor[(2 n + 1)*r] - Floor[n*r + r] - Floor[n*r], {n, 1, z}] (* {A327174(n) : n > 0} *)

Flatten[Position[t, 0]] (* A327175 *)

Flatten[Position[t, 1]] (* A327176 *)

CROSSREFS

Cf. A327174, A327175 (complement).

Sequence in context: A098740 A116046 A069579 * A065193 A116047 A061885

Adjacent sequences: A327173 A327174 A327175 * A327177 A327178 A327179

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Aug 25 2019

EXTENSIONS

Corrected by Jianing Song, Sep 30 2019

STATUS

approved