id:A039616 - OEIS Search Results

Search: id:A039616

Displaying 1-1 of 1 results found.

page 1

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

+0
4

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

	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: A010144 A119506 A130875 this_sequence A089562 A104621 A048834` `Adjacent sequences: A039613 A039614 A039615 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.