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 A276792 #17 Jan 05 2025 19:51:41 %S A276792 7,6,7,4,7,6,7,7,6,7,4,7,6,7,6,7,4,7,6,7,7,6,7,4,7,6,7,4,7,6,7,7,6,7, %T A276792 4,7,6,7,6,7,4,7,6,7,7,6,7,4,7,6,7,7,6,7,4,7,6,7,6,7,4,7,6,7,7,6,7,4, %U A276792 7,6,7,4,7,6,7,7,6,7,4,7,6,7,6,7,4,7,6,7,7,6,7,4,7,6,7,6,7,4,7 %N A276792 First differences of A003146. %H A276792 Rémy Sigrist, <a href="/A276792/b276792.txt">Table of n, a(n) for n = 1..10608</a> %H A276792 Elena Barcucci, Luc Belanger and Srecko Brlek, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/42-4/quartbarcucci04_2004.pdf">On tribonacci sequences</a>, Fib. Q., 42 (2004), 314-320. See page 317. %H A276792 F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, <a href="https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p52/8039">Queens in exile: non-attacking queens on infinite chess boards</a>, Electronic J. Combin., 27:1 (2020), #P1.52. %F A276792 a(n) = A003146(n+1) - A003146(n), for n >= 1. %F A276792 a(n) = A276788(n) + A276789(n) + 1, for n >= 1. %F A276792 a(n+1) = 7 - t(n)*(t(n) + 1)/2, n >= 0, where t(n) = A080843(n). - _Wolfdieter Lang_, Dec 06 2018 %Y A276792 Cf. A003144, A003145, A003146, A080843, A276788, A276789. %K A276792 nonn,easy %O A276792 1,1 %A A276792 _N. J. A. Sloane_, Oct 27 2016