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!)
A099267 Numbers generated by the golden sieve. 13

%I #44 Sep 28 2021 05:44:11

%S 2,3,5,6,8,10,11,13,14,16,18,19,21,23,24,26,27,29,31,32,34,35,37,39,

%T 40,42,44,45,47,48,50,52,53,55,57,58,60,61,63,65,66,68,69,71,73,74,76,

%U 78,79,81,82,84,86,87,89,90,92,94,95,97,99,100,102,103,105,107,108,110

%N Numbers generated by the golden sieve.

%C Let f(n) denote the n-th term of the current working sequence. Start with the positive integers:

%C 1,2,3,4,5,6,7,8,9,10,11,12,...

%C Delete the term in position f(1), which is f(f(1))=f(1)=1, leaving:

%C 2,3,4,5,6,7,8,9,10,11,12,...

%C Delete the term in position f(2), which is f(f(2))=f(3)=4, leaving:

%C 2,3,5,6,7,8,9,10,11,12,...

%C Delete the term in position f(3), which is f(f(3))=f(5)=7, leaving:

%C 2,3,5,6,8,9,10,11,12,...

%C Delete the term in position f(4), which is f(f(4))=f(6)=9, leaving:

%C 2,3,5,6,8,10,11,12,...

%C Iterating the "sieve" indefinitely produces the sequence:

%C 2,3,5,6,8,10,11,13,14,16,18,19,21,23,24,26,27,29,31,32,34,35,37,39,...

%C Positions of 1 in A189479. - _Clark Kimberling_, Apr 22 2011

%H Reinhard Zumkeller, <a href="/A099267/b099267.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>

%F a(n) = floor(n*phi + 2 - phi) where phi = (1 + sqrt(5))/2.

%F a(a(...a(1)...)) with n iterations equals F(n+1) = A000045(n+1).

%F For n>0 and k>0 we have a(a(n) + F(k) - (1 + (-1)^k)/2) = a(a(n)) + F(k+1) - 1 - (-1)^k. - _Benoit Cloitre_, Nov 22 2004

%F a(n) = a(a(n)) - n. - _Marc Morgenegg_, Sep 23 2019

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

%t Flatten[Position[t, 0]] (*A007066*)

%t Flatten[Position[t, 1]] (*A099267*)

%o (Haskell)

%o a099267 n = a099267_list !! (n-1)

%o a099267_list = f 1 [1..] 0 where

%o f k xs y = ys' ++ f (k+1) (ys ++ xs') g where

%o ys' = dropWhile (< y) ys

%o (ys,_:xs') = span (< g) xs

%o g = xs !! (h - 1)

%o h = xs !! (k - 1)

%o -- _Reinhard Zumkeller_, Sep 18 2011

%Y Numbers n such that a(n+1)-a(n)=2 are given by A004956.

%Y If prefixed by an initial 1, same as A026355.

%Y Cf. A001622, A136119, A007066, A189479.

%Y Complement of A007066. - _Gerald Hillier_, Dec 19 2008

%Y Cf. A193213 (primes).

%K nonn,easy,nice

%O 1,1

%A _Benoit Cloitre_, Nov 15 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.)