A039616 - OEIS

This site is supported by donations to The OEIS Foundation.

A039616

Solution to a "self-describing sequence" puzzle of Raphael Robinson.

1, 0, 7, 1, 3, 2, 2, 3, 1, 4, 1, 5, 1, 6, 2, 7, 1, 8, 1, 9 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	REFERENCES	`J. Sauerberg and L. Shu, The long and the short on counting sequences, Amer. Math. Monthly, 104 (1997), 306-317.`
	CROSSREFS	`Cf. A039617.` `Sequence in context: A119506 A130875 A200923 * A201585 A089562 A104621` `Adjacent sequences: A039613 A039614 A039615 * A039617 A039618 A039619`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Corrected by Eric Angelini, Jul 05 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.