id:A153452 - OEIS Search Results

Search: id:A153452

Displaying 1-1 of 1 results found.

page 1

a(1)=1, for n>1, if 2*m = n or (m/p)*nextprime(p) = n, where p is a prime factor of m ( m runs from 1 to n-1 ), then a(n) = Sum_{m} a(m).

+0
7

1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 3, 1, 4, 5, 1, 1, 5, 1, 6, 9, 5, 1, 4, 5, 6, 5, 10, 1, 16, 1, 1, 14, 7, 14, 9, 1, 8, 20, 10, 1, 35, 1, 15, 21, 9, 1, 5, 14, 21, 27, 21, 1, 14, 28, 20, 35, 10, 1, 35, 1, 11, 56, 1, 48, 64, 1, 28, 44, 70, 1, 14, 1 (list; graph; listen)

	OFFSET	`1,6`
	EXAMPLE	`For n=10; (m=5; 25 = 10), (m=6; (6/3)nextprime(3) = 10), hence a(10) = a(5) + a(6) = 3.`
	CROSSREFS	`Sequence in context: A025830 A083796 A037039 this_sequence A090680 A029254 A063740` `Adjacent sequences: A153449 A153450 A153451 this_sequence A153453 A153454 A153455`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (fwqfg726(AT)ybb.ne.jp), Dec 26 2008`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research