A276788 First differences of A003144.
2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2
Offset: 1
Links
- Robert Israel, Table of n, a(n) for n = 1..10608
- Elena Barcucci, Luc Belanger and Srecko Brlek, On tribonacci sequences, Fib. Q., 42 (2004), 314-320. See page 316.
- F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, Queens in exile: non-attacking queens on infinite chess boards, Electronic J. Combin., 27:1 (2020), #P1.52.
Crossrefs
Programs
-
Maple
M:= 10: # to use M generations of strings S[1]:="a": S[2]:="ab": S[3]:="abac": for n from 4 to M do S[n]:=cat(S[n-1], S[n-2], S[n-3]); od: P:=select(t -> S[M][t]="a", [$1..length(S[M])]): P[2..-1]-P[1..-2]; # Robert Israel, Nov 01 2016
Comments