id:A091566 - OEIS Search Results

Search: id:A091566

Displaying 1-1 of 1 results found.

page 1

Start with 10000 = DIX MILLE in French; to get the next term, replace each single letter by its equivalent Roman number if there is one; read the new number in French and repeat.

+0
1

10000, 500110100015050, 1001100150501100500110050011010001505015001001000115050111000150501001 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`G. Pfeiffer, Counting Transitive Relations, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.2.`
	CROSSREFS	`Cf. A096968, A096973.` `Sequence in context: A096968 A017644 A013857 this_sequence A113758 A115850 A082567` `Adjacent sequences: A091563 A091564 A091565 this_sequence A091567 A091568 A091569`
	KEYWORD	`nonn,word,bref`
	AUTHOR	`Pierre CAMI (pierrecami(AT)tele2.fr), Aug 19 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research