Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Apr 29 2024 18:28:56
%S 3,12,16,22,31,40,44,53,57,63,72,76,82,91,100,104,110,119,128,132,141,
%T 145,151,160,169,173,182,186,192,201,205,211,220,229,233,242,246,252,
%U 261,265,271,280,289,293,299,308,317,321,330,334,340,349,353,359,368
%N 3rd column of 3rd-order Zeckendorf array A136189.
%H A.H.M. Smeets, <a href="/A064106/b064106.txt">Table of n, a(n) for n = 1..20000</a>
%F Any number n has a unique representation as a sum of terms from {3, 4, 6, 9, 13, 19, ...} (cf. A000930) such that no two terms are adjacent or pen-adjacent; e.g. 12=9+3. Sequence gives all n where that representation involves 3.
%Y Cf. A020942, A064105, A136189.
%K easy,nonn
%O 1,1
%A _Naohiro Nomoto_, Sep 17 2001
%E Offset corrected by _N. J. A. Sloane_, Apr 29 2024