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 A381495 #19 Mar 09 2025 16:40:21 %S A381495 0,2,2,1,3,1,5,2,3,2,2,0,2,0,2,1,0,1,4,2,3,2,3,1,6,0,1,0,4,0,5,2,0,1, %T A381495 0,1,6,0,4,1,3,2,3,1,1,0,2,1,0,0,2,2,4,1,3,0,4,1,4,1,4,1,1,3,1,4,2,0, %U A381495 1,1,2,1,3,0,2,3,3,1,2,3,1,1,2,1,0,0,2,1,1,2,4,0,0,2,1,0,3,0,2,1,2,1,2,0,0,0,3,2,3,0,3,1,3,1,1,2,4,1,3,1,3,0,1,0,2,1,4,1,1,1 %N A381495 a(n) is the number of times n appears in A381466. %C A381495 The sequence is well defined, as we have proven that A381466(n) > sqrt(n/6) for all n, and thus each number can only appear a finite amount of times in A381466. %C A381495 It appears that this sequence has an average value of approximately 1.755 %H A381495 Sam Chapman, <a href="/A381495/b381495.txt">Table of n, a(n) for n = 1..2000</a> %Y A381495 Cf. A381466, A381501 (indices of 0's). %K A381495 nonn %O A381495 1,2 %A A381495 _Sam Chapman_, Feb 25 2025