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 A265330 #10 Dec 29 2015 03:06:58 %S A265330 0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1, %T A265330 0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2, %U A265330 0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,3 %N A265330 Zero-based row index to A265345; 2-adic valuation of bijective base-3 reversal of n: a(n) = A007814(A263273(n)). %H A265330 Antti Karttunen, <a href="/A265330/b265330.txt">Table of n, a(n) for n = 1..6561</a> %F A265330 a(n) = A007814(A263273(n)). %F A265330 a(2n+1) = 0, a(2n) = 1 + a(A265352(n)). %e A265330 For n = 32, in base-3 "1012" [= A007089(32)], when we reverse it, we get "2101" [= A007089(64)], and 2-adic valuation of 64 [= "1000000" = A007088(64)] is 6, thus a(32) = 6. %o A265330 (Scheme, two variants) %o A265330 (definec (A265330 n) (if (odd? n) 0 (+ 1 (A265330 (A265352 (/ n 2)))))) %o A265330 (define (A265330 n) (A007814 (A263273 n))) %Y A265330 One less than A265331. %Y A265330 Cf. A007088, A007089, A263273, A265345, A265352. %Y A265330 Cf. A265910 (corresponding other index). %Y A265330 Cf. also A265336, A265337, A265340. %Y A265330 Differs from A007814 for the first time at n=32, where a(32) = 6, while A007814(32) = 5. %K A265330 nonn,base %O A265330 1,4 %A A265330 _Antti Karttunen_, Dec 18 2015