Enumeration of the 1 sequences using 9 digits as an initial number
Initial number
Depth: 0
| 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
Depth: 1
| 123456789|  L5   L1   L6   L2   L7   L3   L8   L4   L9 , L5>=1, L1>=1, L6>=1, L2>=1, L7>=1, L3>=1, L8>=1, L4>=1, L9>=1
Degeneration: If L1 = L2, L1 = L4, L1 = L5, L1 = L7, L1 = L8, L3 = L6, then
the above is the same as one at depth 0
Cyclic. length=1 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Depth: 1
| 123456789|  L5   L1   L6   L2   L7   L3   L8   L4   L9 , L5>=1, L1>=1, L6>=1, L2>=1, L7>=1, L3>=1, L8>=1, L4>=1, L9>=1
Depth: 2
| 123456789|  L7   L5   L3   L1   L8   L6   L4   L2   L9 , L7>=1, L5>=1, L3>=1, L1>=1, L8>=1, L6>=1, L4>=1, L2>=1, L9>=1
Degeneration: If L1 = L2, L1 = L5, L2 = L4, L2 = L7, L2 = L8, L3 = L6, then
the above is the same as one at depth 1
Cyclic. length=1 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Depth: 2
| 123456789|  L7   L5   L3   L1   L8   L6   L4   L2   L9 , L7>=1, L5>=1, L3>=1, L1>=1, L8>=1, L6>=1, L4>=1, L2>=1, L9>=1
Depth: 3
| 123456789|  L8   L7   L6   L5   L4   L3   L2   L1   L9 , L8>=1, L7>=1, L6>=1, L5>=1, L4>=1, L3>=1, L2>=1, L1>=1, L9>=1
Degeneration: If L1 = L2, L1 = L4, L1 = L5, L1 = L7, L1 = L8, L3 = L6, then
the above is the same as one at depth 2
Cyclic. length=1 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Depth: 3
| 123456789|  L8   L7   L6   L5   L4   L3   L2   L1   L9 , L8>=1, L7>=1, L6>=1, L5>=1, L4>=1, L3>=1, L2>=1, L1>=1, L9>=1
Depth: 4
| 123456789|  L4   L8   L3   L7   L2   L6   L1   L5   L9 , L4>=1, L8>=1, L3>=1, L7>=1, L2>=1, L6>=1, L1>=1, L5>=1, L9>=1
Degeneration: If L1 = L2, L1 = L4, L1 = L5, L1 = L8, L3 = L6, L5 = L7, then
the above is the same as one at depth 3
Cyclic. length=1 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Depth: 4
| 123456789|  L4   L8   L3   L7   L2   L6   L1   L5   L9 , L4>=1, L8>=1, L3>=1, L7>=1, L2>=1, L6>=1, L1>=1, L5>=1, L9>=1
Depth: 5
| 123456789|  L2   L4   L6   L8   L1   L3   L5   L7   L9 , L2>=1, L4>=1, L6>=1, L8>=1, L1>=1, L3>=1, L5>=1, L7>=1, L9>=1
Degeneration: If L1 = L2, L1 = L4, L1 = L5, L1 = L7, L3 = L6, L4 = L8, then
the above is the same as one at depth 4
Cyclic. length=1 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Depth: 5
| 123456789|  L2   L4   L6   L8   L1   L3   L5   L7   L9 , L2>=1, L4>=1, L6>=1, L8>=1, L1>=1, L3>=1, L5>=1, L7>=1, L9>=1
Depth: 6
| 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
The above is the same as one at depth 0
Cyclic. length=6 inductions=0//
From (d=0) | 123456789|  L1   L2   L3   L4   L5   L6   L7   L8   L9 , L1>=1, L2>=1, L3>=1, L4>=1, L5>=1, L6>=1, L7>=1, L8>=1, L9>=1
conditions:none

Found cyclic sequences: 6
Found inductive sequences: 0