cp's OEIS Frontend

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.

A243610 Irregular triangular array of all the integers, each exactly once, ordered as in Comments.

This page as a plain text file.
%I A243610 #8 Jan 05 2025 19:51:40
%S A243610 1,0,2,-1,4,-3,-2,8,-7,-6,-4,3,16,-15,-14,-12,-8,5,6,7,32,-31,-30,-28,
%T A243610 -24,-16,-5,9,10,12,13,14,15,64,-63,-62,-60,-56,-48,-32,-13,-11,-10,
%U A243610 -9,17,18,20,24,25,26,28,29,30,31,128,-127,-126,-124,-120,-112
%N A243610 Irregular triangular array of all the integers, each exactly once, ordered as in Comments.
%C A243610 Let F = A000045 (the Fibonacci numbers).  To construct the array, decree the first 4 rows as in the Example.  Thereafter, row n consists of F(n) numbers in increasing order, generated as follows:  the F(n-1) numbers 2*x from x in row n-1, together with the F(n-2) numbers 1 - 2*x from numbers x in row n-2.  For n >= 3, row n consists of F(n-1) negative integers and F(n-2) positive integers; also, row n consists of F(n-1) even integers and F(n-2) odd integers.  Conjecture:  Every row contains F(k) or -F(k) for some k.
%H A243610 Clark Kimberling, <a href="/A243610/b243610.txt">Table of n, a(n) for n = 1..4000</a>
%H A243610 Danielle Cox and Karyn McLellan, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/55-2/CoxMcLellan021717.pdf">A Problem on Generation Sets Containing Fibonacci Numbers</a>, Fibonacci Quart. 55 (2017), no. 2, 105-113.
%e A243610 First 7 rows of the array:
%e A243610 1
%e A243610 0 .... 2
%e A243610 -1 ... 4
%e A243610 -3 ... -2 ... 8
%e A243610 -7 ... -6 ... -4 ... 3 .... 16
%e A243610 -15 .. -14 .. -12 .. -8 ... 5 .... 6 ... 7 .. 32
%e A243610 -31 .. -30 .. -28 .. -24 .. -16 .. -5 .. 9 .. 10 . 12 . 13 . 14 . 15 . 64
%t A243610 z = 12; g[1] = {1}; f1[x_] := 2 x; f2[x_] := 1 - x; h[1] = g[1];
%t A243610 b[n_] := b[n] = DeleteDuplicates[Union[f1[g[n - 1]], f2[g[n - 1]]]];
%t A243610 h[n_] := h[n] = Union[h[n - 1], g[n - 1]];
%t A243610 g[n_] := g[n] = Complement [b[n], Intersection[b[n], h[n]]]
%t A243610 u = Table[g[n], {n, 1, 12}]
%t A243610 v = Flatten[u]
%Y A243610 Cf. A243571, A000045.
%K A243610 easy,tabf,sign
%O A243610 1,3
%A A243610 _Clark Kimberling_, Jun 08 2014