id:A129252 - OEIS Search Results

Search: id:A129252

Displaying 1-1 of 1 results found.

page 1

Smallest prime factor p of n such that p^p is a divisor of n, a(n)=1 if no such factor exists.

+0
2

1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) = 1 iff A129251(n) = 0, a(A048103(n)) = 1.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000`
	CROSSREFS	`Cf. A020639, A008578, A051674.` `Adjacent sequences: A129249 A129250 A129251 this_sequence A129253 A129254 A129255` `Sequence in context: A138191 A069291 A081117 this_sequence A022929 A115362 A053543`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 07 2007`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research