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.
%I A263088 #9 Nov 09 2015 16:06:00 %S A263088 0,6,2,38,2,1,1,1,1,22,1,0,0,2,1,3,1,9,1,39,1,47,1,51,4,114,1,1,1,529, %T A263088 2,6,2,3,1,1,22,1,11,3,2,4,7,93,7,967,1,1,3,4,1,3,2,4,1,3,1,3,1,1,1,2, %U A263088 1,139,2,265,2,1,6,464,12,4,22,1,2,1503,2,6,1,5,2,2,1,2,5,1,2,4,2,1,1,6,3,386,1,1,3,800,1,2,1,7,5,1,1,3353,1,2,21,3,1,17,3,3,1,4,1,5,1,3,9,2 %N A263088 a(n) = A262697(n^2). %C A263088 a(n)=0 if n^2 is in A259934, otherwise number of nodes in that finite subtree whose root is n^2 and edge-relation is defined by A049820(child) = parent. This count includes also leaves and n^2 itself. %H A263088 Antti Karttunen, <a href="/A263088/b263088.txt">Table of n, a(n) for n = 0..222</a> %F A263088 a(n) = A262697(A000290(n)) = A262697(n^2). %F A263088 Other identities. For all n >= 0: %F A263088 If A263087(n) = 0, a(n) = 1. %o A263088 (Scheme) (define (A263088 n) (A262697 (A000290 n))) %Y A263088 Cf. A000290, A049820, A259934, A262697. %Y A263088 Cf. also A261088, A263087. %Y A263088 Cf. A262515 (positions of zeros), A263093 (positions of ones). %K A263088 nonn %O A263088 0,2 %A A263088 _Antti Karttunen_, Oct 12 2015