|
Search: id:A061264
|
|
|
| A061264 |
|
Number of cyclic permutations of the digits of n which give primes. |
|
+0
1
|
|
| 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 2, 1, 0, 1, 2, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 2, 1, 0, 1, 1, 0, 2, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 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, 2, 0, 2, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,11
|
|
|
EXAMPLE
|
a(157) = 2 as among the three cyclic permutations 157, 571, 715, two are primes.
|
|
MAPLE
|
A055642 := proc(n) max(1, ilog10(n)+1) ; end: A061264 := proc(n) local ncyc, s, dgs, a, L, i ; a := 0 ; dgs := convert(n, base, 10) ; ncyc := n ; for s from 1 to A055642(n) do if isprime(ncyc) then a := a+1 ; fi; L := ListTools[Rotate](dgs, s) ; ncyc := add(op(i, L)*10^(i-1), i=1..nops(L)) ; od: RETURN(a) ; end: for n from 1 to 120 do printf("%d, ", A061264(n)) ; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008]
|
|
CROSSREFS
|
A039999.
Cf. A046810. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008]
Sequence in context: A069848 A118682 A083054 this_sequence A112300 A049239 A036580
Adjacent sequences: A061261 A061262 A061263 this_sequence A061265 A061266 A061267
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 24 2001
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008
|
|
|
Search completed in 0.002 seconds
|
