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.

A371590 Irregular table T(n, k), n >= 0, k = 1..max(2, 2^n), read by rows; the n-th row lists the nonnegative numbers whose Zeckendorf-binary representation has n nonleading zeros.

This page as a plain text file.
%I A371590 #10 Apr 14 2024 10:04:21
%S A371590 0,1,2,4,3,6,7,12,5,9,10,11,17,19,20,33,8,14,15,16,18,25,27,28,30,31,
%T A371590 32,46,51,53,54,88,13,22,23,24,26,29,38,40,41,43,44,45,48,49,50,52,67,
%U A371590 72,74,75,80,82,83,85,86,87,122,135,140,142,143,232
%N A371590 Irregular table T(n, k), n >= 0, k = 1..max(2, 2^n), read by rows; the n-th row lists the nonnegative numbers whose Zeckendorf-binary representation has n nonleading zeros.
%C A371590 As a flat sequence, this is a permutation of the nonnegative integers with inverse A371591.
%H A371590 Rémy Sigrist, <a href="/A371590/a371590.gp.txt">PARI program</a>
%H A371590 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A371590 A102364(T(n, k)) = n.
%F A371590 T(n, 1) = A000045(n + 2) for any n > 0.
%F A371590 T(n, max(2, 2^n)) = A027941(n + 1) for any n >= 0.
%e A371590 Array T(n, k) begins:
%e A371590     0, 1
%e A371590     2, 4
%e A371590     3, 6, 7, 12
%e A371590     5, 9, 10, 11, 17, 19, 20, 33
%e A371590     8, 14, 15, 16, 18, 25, 27, 28, 30, 31, 32, 46, 51, 53, 54, 88
%e A371590     ...
%o A371590 (PARI) \\ See Links section.
%Y A371590 See A371592 for a similar sequence.
%Y A371590 Cf. A000045, A027941, A102364, A371591 (inverse).
%K A371590 nonn,base,tabf
%O A371590 0,3
%A A371590 _Rémy Sigrist_, Mar 28 2024