|
%I #10 May 13 2015 15:43:38
%S 1,4,7,9,12,17,18,21,23,24,25,27,30,34,35,38,41,42,49,52,53,54,55,57,
%T 60,64,65,68,70,73,74,75,76,77,81,82,83,90,93,95,96,103,106,107,108,
%U 109,111,114,118,119,122,127,128,131,132,134,136,137,138,139,140,145,147,148,149,150,151,155,156,157,164,167,168,171
%N Positions of odd numbers in A233271, the infinite trunk of inverted binary beanstalk.
%H Antti Karttunen, <a href="/A257803/b257803.txt">Table of n, a(n) for n = 1..7973</a>
%F Other identities:
%F For all n >= 1, A257807(a(n)) = n. [A257807 works as a left inverse for this injective function.]
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A257803 (MATCHING-POS 1 1 (lambda (n) (odd? (A233271 n)))))
%o (define A257803 (MATCHING-POS 1 1 (lambda (n) (odd? (A257800 n)))))
%Y Complement: A257804.
%Y Cf. A233271, A257800, A257806, A257807.
%K nonn
%O 1,2
%A _Antti Karttunen_, May 12 2015
|
