id:A075053 - OEIS Search Results

Search: id:A075053

Displaying 1-1 of 1 results found.

page 1

Number of primes (counted with repetition) that can be formed by rearranging some or all of the digits of n.

+0
4

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

	OFFSET	`0,14`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000`
	EXAMPLE	`From 17 we can obtain 7, 17 and 71 so a(17) = 3. From 22 we obtain 2 in two ways, so a(22) = 2.`
	CROSSREFS	`Different from A039993. Cf. A072857, A076449, A039999.` `Cf. A039999` `Sequence in context: A030408 A068153 A039993 this_sequence A007362 A060268 A030328` `Adjacent sequences: A075050 A075051 A075052 this_sequence A075054 A075055 A075056`
	KEYWORD	`nonn,base,easy`
	AUTHOR	`njas, Oct 12 2002`
	EXTENSIONS	`Corrected and extended by John W. Layman (layman(AT)math.vt.edu), Oct 15 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research