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!)
A268672 a(n) = n - A268395(n). 4

%I #11 Feb 12 2016 10:32:03

%S 0,1,2,2,3,2,2,3,4,4,3,4,4,5,6,4,5,2,2,3,2,3,4,4,4,5,6,5,6,6,4,5,6,6,

%T 3,4,4,5,6,5,4,5,6,6,7,5,5,6,6,7,8,4,5,5,4,5,6,5,5,6,4,5,6,6,7,6,6,7,

%U 4,5,6,6,6,7,8,6,7,7,6,7,6,7,8,8,9,4,4,5,6,6,4,5,5,6,7,6,6,7,8,7,8,8,4,5,6,4,4,5,4,5,6,6,7,7,6,7,7,8,9,6,4

%N a(n) = n - A268395(n).

%C It seems that the sequence stays strictly positive after a(0).

%C Only 1 seems to be at a(1).

%C 2's occur in this sequence at least in the following positions: 2, 3, 5, 6, 17, 18, 20, 257, 258, 260, 272, 65537, 65538, 65540, 65552, 65792, and in no other location up to 2^21.

%C See also comments in A268708.

%H Antti Karttunen, <a href="/A268672/b268672.txt">Table of n, a(n) for n = 0..65537</a>

%F a(n) = n - A268395(n).

%o (Scheme) (define (A268672 n) (- n (A268395 n)))

%Y Cf. A001317, A268395, A268708.

%Y Cf. A268713 (record positions).

%K nonn

%O 0,3

%A _Antti Karttunen_, Feb 10 2016

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 27 13:50 EDT 2024. Contains 372019 sequences. (Running on oeis4.)