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.

A277700 a(n) = A000120(A264977(n)); number of odd terms on row n of A125184.

This page as a plain text file.
%I A277700 #12 Oct 30 2016 13:44:15
%S A277700 0,1,1,2,1,1,2,3,1,2,1,3,2,1,3,4,1,3,2,3,1,2,3,3,2,3,1,4,3,1,4,5,1,4,
%T A277700 3,3,2,3,3,2,1,1,2,3,3,2,3,3,2,3,3,4,1,3,4,3,3,4,1,5,4,1,5,6,1,5,4,3,
%U A277700 3,4,3,3,2,3,3,2,3,3,2,3,1,2,1,3,2,1,3,4,3,3,2,3,3,2,3,3,2,3,3,4,3,3,4,3,1,2,3,3,4,3,3,4,3,3,4,5,1,4,5,3,4
%N A277700 a(n) = A000120(A264977(n)); number of odd terms on row n of A125184.
%C A277700 Positions of even and odd terms are given by A008585 and A001651, which means that parity-wise the terms match with the Fibonacci numbers, A000045.
%H A277700 Antti Karttunen, <a href="/A277700/b277700.txt">Table of n, a(n) for n = 0..8193</a>
%F A277700 a(n) = A000120(A264977(n)).
%F A277700 a(n) = A001221(A277330(n)) = A001222(A277330(n)).
%F A277700 Other identities. For all n >= 0:
%F A277700 a(2n) = a(n).
%F A277700 A000035(a(n)) = A011655(n).
%o A277700 (Scheme) (define (A277700 n) (A000120 (A264977 n)))
%Y A277700 Cf. A000120, A001221, A001222, A125184, A264977, A277330.
%Y A277700 Cf. also A000045, A001651, A008585, A011655.
%K A277700 nonn
%O A277700 0,4
%A A277700 _Antti Karttunen_, Oct 27 2016