|
| |
|
|
A101809
|
|
Sequence formed by writing out the primes, one digit at a time, prefixing each prime by the number of digits it contains (the latter number being written as a normal decimal number, not digit-by-digit).
|
|
0
| |
|
|
1, 2, 1, 3, 1, 5, 1, 7, 2, 1, 1, 2, 1, 3, 2, 1, 7, 2, 1, 9, 2, 2, 3, 2, 2, 9, 2, 3, 1, 2, 3, 7, 2, 4, 1, 2, 4, 3, 2, 4, 7, 2, 5, 3, 2, 5, 9, 2, 6, 1, 2, 6, 7, 2, 7, 1, 2, 7, 3, 2, 7, 9, 2, 8, 3, 2, 8, 9, 2, 9, 7, 3, 1, 0, 1, 3, 1, 0, 3, 3, 1, 0, 7, 3, 1, 0, 9, 3, 1, 1, 3, 3, 1, 2, 7, 3, 1, 3, 1, 3, 1, 3, 7, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| List of pairs: (number of digits of prime(n), digits of prime(n)).
As a decimal number this is 0.12131517211213217219223....
|
|
|
MATHEMATICA
| Flatten[{IntegerLength[#], IntegerDigits[#]}&/@Prime[Range[50]]] (* From Harvey P. Dale, Jul 12 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A168008 A119479 A130008 * A127203 A126132 A129982
Adjacent sequences: A101806 A101807 A101808 * A101810 A101811 A101812
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Ryan B. Florence (rflorence2004(AT)yahoo.com), Feb 01 2005
|
| |
|
|
