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 A064105 #24 Mar 08 2025 11:04:33
%S A064105 2,8,11,15,21,27,30,36,39,43,49,52,56,62,68,71,75,81,87,90,96,99,103,
%T A064105 109,115,118,124,127,131,137,140,144,150,156,159,165,168,172,178,181,
%U A064105 185,191,197,200,204,210,216,219,225,228,232,238,241,245,251
%N A064105 2nd column of 3rd-order Zeckendorf array A136189.
%H A064105 A.H.M. Smeets, <a href="/A064105/b064105.txt">Table of n, a(n) for n = 1..20000</a>
%F A064105 Any number n has a unique representation as a sum of terms from {2, 3, 4, 6, 9, 13, 19, ...} (cf. A000930) such that no two terms are adjacent or pen-adjacent; e.g. 8=6+2. Sequence gives all n where that representation involves 2.
%F A064105 a(n) = A020942(n) + A136495(n). - _Alan Michael Gómez Calderón_, Dec 21 2024
%F A064105 a(n) = A381841(n) - 1. - _Jeffrey Shallit_, Mar 08 2025
%Y A064105 Cf. A020942, A064106, A136189.
%K A064105 easy,nonn
%O A064105 1,1
%A A064105 _Naohiro Nomoto_, Sep 17 2001
%E A064105 Offset corrected by _N. J. A. Sloane_, Apr 29 2024