Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
Cf. A327036 (same sequence , but without counting overlapping strings instances of the same digit string are not counted among the repeats).
proposed
editing
editing
proposed
Cf. A327036 (same sequence but without counting overlapping strings among the repeats).
proposed
editing
editing
proposed
To calculate a(n) take all the terms from a(0) to a(n-1), concatenate them, and then count the distinct digit strings that have at least two occurrences (including any overlapping occurrencesthat overlap). For example, if the concatenated terms formed the string '2210102240404' then the next term would be 9 as the strings '0','1','2','4','04','10','22','40','404' have all occurred at least twice. (The two occurrences of '404' overlap.)
In the first 20000 terms, the largest increase in consecutive terms is from a(13058) = 47849 to a(13059) = 47885, an increase of 36. The , and the concatenation of a(13006) = 47623 to the previous terms results in the longest repeated string, '47611476114761147'.
a(1) = 0 as there have been no repeated string up strings prior to a(1).
a(2) = 1 as there has been one repeat of '0', which occurs in a(0) then and a(1).
a(23) = 14 as a(22) = '12' created a repeat of the string '12', with a(3) and a(4), and also created an overlapping repeat of the string '101' which is in both '10,10' and '10,12'. Note this later string also contains '01' but that has already repeated and been counted previously so is ignored as the count is of unique distinct strings.
To calculate a(n) take all the entries terms from a(0) to a(n-1), concatenate them, and then count the number of unique distinct digit strings that have repeated one or more times, allowing for repeated strings to overlapat least two occurrences (including any overlapping occurrences). For example , if the concatenated entries terms formed the string '2210102240404' then the next entry term would be 9 as the strings '0','1','2','4','04','10','22','40','04','404', have all repeatedoccurred at least twice. (The two occurrences of '404' overlap.)
In the first 20000 term terms, the largest increase in consecutive entries terms is from a(13058) = 47849 to a(13059) = 47885, an increase of 36. The largest concatenation of a(13006) = 47623 to the previous terms results in the longest repeated string is after a(13006) = 47623 which repeats , '47611476114761147'.
a(0) = 0; for n > 0, a(n) is the number of unique distinct digit strings from a(0) to athat occur at least twice (n-1), when all these entries are concatenated, which have repeated one or more times. Repeated strings can be including any overlapping occurrences) in the concatenation of all previous terms.
approved
editing
proposed
approved