login
Lexicographically earliest increasing sequence such that the derived triangle T(n,k) = "a(n) represented in base a(k)" (with k < n) contains only distinct representations.
1

%I #13 Apr 01 2015 10:32:25

%S 2,3,5,8,13,17,23,30,39,54,66,74,88,107,145,166,191,209,238,261,312,

%T 343,380,408,468,507,568,616,703,769,795,886,918,1109,1120,1217,1323,

%U 1399,1466,1510,1727,1808,1936,2005,2094,2167,2216,2361,2497,2580,2899

%N Lexicographically earliest increasing sequence such that the derived triangle T(n,k) = "a(n) represented in base a(k)" (with k < n) contains only distinct representations.

%C We do not take into account the unary base, hence a(1)>1.

%H Paul Tek, <a href="/A256121/b256121.txt">Table of n, a(n) for n = 1..1000</a>

%H Paul Tek, <a href="/A256121/a256121.pl.txt">Perl program for this sequence</a>

%H Paul Tek, <a href="/A256121/a256121.pdf">first rows of the derived triangle T(n,k) = "a(n) represented in base a(k)"</a>

%o (Perl) See Links section.

%Y Cf. A005282.

%K nonn,base

%O 1,1

%A _Paul Tek_, Mar 15 2015