id:A135156 - OEIS Search Results

Search: id:A135156

Displaying 1-1 of 1 results found.

page 1

a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring of length >= 2 in place.

+0
3

1, 0, 2, 0, 3, 1, 4, 0, 5, 2, 6, 1, 7, 3, 8, 9, 9, 7, 10, 34, 11, 36, 12, 136, 13, 190, 14, 567, 15, 1018, 16, 2445, 17, 5474, 18, 11371, 19, 28233, 20, 57961, 21, 143391, 22, 308793, 23, 740519, 24, 1668316 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A "weakly primitive" version of A135473. Cf. A135017.` `Differs from A135017 in that the strings may contain repeated letters.`
	LINKS	`Index entries for doubling substrings`
	CROSSREFS	`Adjacent sequences: A135153 A135154 A135155 this_sequence A135157 A135158 A135159` `Sequence in context: A029219 A110514 A135157 this_sequence A063277 A029178 A082375`
	KEYWORD	`nonn`
	AUTHOR	`David Applegate and njas, Feb 15 2008`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research