cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A257249 a(0) = 1, and for n >= 1, if A079559(n) = 0, then a(n) = 1 + a(A234017(n)), otherwise a(n) = a(A213714(n)-1).

This page as a plain text file.
%I A257249 #15 Apr 19 2015 22:25:29
%S A257249 1,1,2,1,2,3,2,1,2,3,3,2,4,3,2,1,2,3,3,3,4,4,2,4,3,3,2,5,4,3,2,1,2,3,
%T A257249 3,3,4,4,3,4,4,4,2,5,5,3,4,3,5,3,2,4,4,5,4,3,3,2,6,5,4,3,2,1,2,3,3,3,
%U A257249 4,4,3,4,4,4,3,5,5,4,4,4,5,4,2,5,5,5,5,3,3,4,6,6,4,5,3,5,4,3,2,6,4,4,4,3,5,4,5,5,6,3,3,5,2,6,4,4,5,4,3,3,2,7,6,5,4,3,2,1,2
%N A257249 a(0) = 1, and for n >= 1, if A079559(n) = 0, then a(n) = 1 + a(A234017(n)), otherwise a(n) = a(A213714(n)-1).
%C A257249 Because A233275(n) = A003188(n) for n = 1 .. 9, a(n) = A005811(n) for n = 1 .. 9.
%H A257249 Antti Karttunen, <a href="/A257249/b257249.txt">Table of n, a(n) for n = 0..8191</a>
%F A257249 a(0) = 1, and for n >= 1, if A079559(n) = 0, then a(n) = 1 + a(A234017(n)), otherwise a(n) = a(A213714(n)-1).
%F A257249 Other identities. For all n >= 1:
%F A257249 a(n) = A070939(n) - A257248(n).
%F A257249 a(n) = A000120(A233275(n)). [Binary weight of A233275(n).]
%F A257249 a(n) = 1 + A256479(n) = 1 + A080791(A233277(n)).
%o A257249 (Scheme, alternative definitions, the first one utilizing memoizing definec-macro)
%o A257249 (definec (A257249 n) (if (zero? n) 1 (+ (- 1 (A079559 n)) (A257249 (if (zero? (A079559 n)) (A234017 n) (+ -1 (A213714 n)))))))
%o A257249 (define (A257249 n) (+ 1 (A256479 n)))
%Y A257249 One more than A256479.
%Y A257249 Cf. A000120, A003188, A005811, A055938, A070939, A079559, A080791, A213714, A234017, A233275, A233277, A233278, A257248, A256991.
%K A257249 nonn
%O A257249 0,3
%A A257249 _Antti Karttunen_, Apr 19 2015