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 A352427 #9 Apr 01 2022 09:11:40
%S A352427 0,1,0,1,2,0,1,0,1,2,0,3,0,1,0,1,2,0,1,0,1,2,0,3,0,1,0,1,4,0,1,0,1,2,
%T A352427 0,1,0,1,2,0,3,0,1,0,1,2,0,1,0,1,2,0,3,0,1,0,1,4,0,1,0,1,2,0,1,0,1,2,
%U A352427 0,5,0,1,0,1,2,0,1,0,1,2,0,3,0,1,0,1
%N A352427 a(n) is the number of trailing 0's in the minimal representation of n in terms of the positive Pell numbers (A317204).
%C A352427 The asymptotic density of the occurrences of 0 is sqrt(2)-1 and of the occurrences of k = 1, 2, ... is 2*(sqrt(2)-1)^(k+1).
%C A352427 The asymptotic mean of this sequence is 1 and its asymptotic variance is sqrt(2).
%H A352427 Amiram Eldar, <a href="/A352427/b352427.txt">Table of n, a(n) for n = 1..10000</a>
%F A352427 a(A000129(n)) = n-1 for n>=1.
%F A352427 a(n) = 0 if and only if n is in A286666.
%F A352427 a(n) > 0 if and only if n is in A286667.
%F A352427 a(n) == 0 (mod 2) if and only if n is in A003152.
%F A352427 a(n) == 1 (mod 2) if and only if n is in A003151.
%t A352427 pell[1] = 1; pell[2] = 2; pell[n_] := pell[n] = 2*pell[n - 1] + pell[n - 2]; a[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[pell[k] <= m, k++]; k--; AppendTo[s, k]; m -= pell[k]; k = 1]; IntegerExponent[Total[3^(s - 1)], 3]]; Array[a, 100]
%Y A352427 Cf. A000129, A003151, A003152, A286666, A286667, A317204.
%Y A352427 Similar sequences: A003849 (dual Zeckendorf), A035614 (Zeckendorf), A230403 (factorial), A276084 (primorial), A278045 (tribonacci).
%K A352427 nonn,base
%O A352427 1,5
%A A352427 _Amiram Eldar_, Mar 16 2022