id:A046810 - OEIS Search Results

Search: id:A046810

Displaying 1-1 of 1 results found.

page 1

Number of anagrams of n that are primes.

+0
12

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

	OFFSET	`1,13`
	COMMENT	`An anagram of a k-digit number is one of the k! permutations of the digits that does not begin with 0.`
	EXAMPLE	`107 has 2 prime anagrams: 107 and 701 (but not 017 or 071); so a(107) = 2.`
	CROSSREFS	`Cf. A039999.` `Sequence in context: A051126 A063933 A085860 this_sequence A039999 A069842 A083056` `Adjacent sequences: A046807 A046808 A046809 this_sequence A046811 A046812 A046813`
	KEYWORD	`nonn,easy,base,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research