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 A003265 M2430 #29 Jan 05 2025 19:51:33 %S A003265 1,3,5,8,10,12,14,16,18,21,23,25,27,29,32,34,36,38,40,42,45,47,49,52, %T A003265 54,56,58,60,62,65,67,69,71,73,76,78,80,82,84,86,89,91,93,95,97,99, %U A003265 102,104,106,108,110,113,115,117,119,121,123 %N A003265 Not representable by truncated tribonacci sequence 2, 4, 7, 13, 24, 44, 81, .... %C A003265 The usual tribonacci representation of n writes n as a sum of tribonacci numbers 1, 2, 4, 7, 13, 24, ... (A000073) avoiding using three consecutive numbers (see A003726, A278038). But if we are not allowed to use 1, then some numbers cannot be represented, and such numbers are listed here. - _N. J. A. Sloane_, Oct 08 2018 %C A003265 Indices of odd terms of A003726. - _Charlie Neder_, Apr 25 2019 %C A003265 Numbers whose tribonacci representation ends in 1. Equivalently, the first column of the Trithoff (tribonacci) array, see A136175. - _Tanya Khovanova_ and PRIMES STEP Senior group, May 07 2022 %D A003265 A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 65. %D A003265 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A003265 Charlie Neder, <a href="/A003265/b003265.txt">Table of n, a(n) for n = 1..1000</a> %H A003265 A. Brousseau, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/fibonacci-tables.html">Fibonacci and Related Number Theoretic Tables</a>, Fibonacci Association, San Jose, CA, 1972, p. 65. %Y A003265 Cf. A000073, A003726, A136175, A278038. %K A003265 nonn %O A003265 1,2 %A A003265 _N. J. A. Sloane_ %E A003265 Edited by _N. J. A. Sloane_, Oct 08 2018 %E A003265 a(47)-a(57) from _Charlie Neder_, Apr 25 2019