id:A085641 - OEIS Search Results

Search: id:A085641

Displaying 1-1 of 1 results found.

page 1

Smallest prime == 1 mod(p*q*...k) where p, q, ...k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest square-free divisor of n).

+0
2

2, 3, 7, 3, 11, 7, 29, 3, 7, 11, 23, 7, 53, 29, 31, 3, 103, 7, 191, 11, 43, 23, 47, 7, 11, 53, 7, 29, 59, 31, 311, 3, 67, 103, 71, 7, 149, 191, 79, 11, 83, 43, 173, 23, 31, 47, 283, 7, 29, 11, 103, 53, 107, 7, 331, 29, 229, 59, 709, 31, 367, 311, 43, 3, 131, 67, 269, 103, 139 (list; graph; listen)

	OFFSET	`2,1`
	COMMENT	`All the numbers having the same set of prime divisors are mapped to the same prime.`
	FORMULA	`a(n) = A034694(A007947(n)).`
	CROSSREFS	`Cf. A007947.` `Sequence in context: A054144 A110057 A086508 this_sequence A086516 A109205 A115630` `Adjacent sequences: A085638 A085639 A085640 this_sequence A085642 A085643 A085644`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy, Jason Earls (zevi_35711(AT)yahoo.com), Jul 11 2003`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research