id:A062537 - OEIS Search Results

Search: id:A062537

Displaying 1-1 of 1 results found.

page 1

Nodes in riff (rooted index-functional forest) for n.

+0
32

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

	OFFSET	`1,3`
	COMMENT	`A061396(n) gives number of times n appears in this sequence.`
	LINKS	`J. Awbrey, Illustrations of riffs for small integers`
	FORMULA	`a(Prod(p_i^e_i)) = Sum(a(i)+a(e_i)+1), product over nonzero e_i in prime factorization.`
	CROSSREFS	`Sequence in context: A072643 A130260 A111393 this_sequence A097688 A025785 A087182` `Adjacent sequences: A062534 A062535 A062536 this_sequence A062538 A062539 A062540`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net), Jun 25, 2001`

page 1

Search completed in 0.002 seconds

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.

AT&T Labs Research