login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299400 a(n) = concatenation of all (i, e_i) with e_i > 0, when n = Product_{i >= 1} prime(i)^e_i. 1
0, 11, 21, 12, 31, 1121, 41, 13, 22, 1131, 51, 1221, 61, 1141, 2131, 14, 71, 1122, 81, 1231, 2141, 1151, 91, 1321, 32, 1161, 23, 1241, 101, 112131, 111, 15, 2151, 1171, 3141, 1222, 121, 1181, 2161, 1331, 131, 112141, 141, 1251, 2231, 1191, 151, 1421, 42, 1132, 2171 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The conventional a(1) = 0 represents the empty concatenation.

Due to simple concatenation, this encoding of the positive integers becomes ambiguous from n = 613 = prime(112)^1 on, which has the same encoding a(n) = 1121 as 6 = prime(1)^1*prime(2)^1. To get a unique encoding, one could use, e.g., the digit 9 as delimiter to separate indices and exponents, written in base 9 as to use only digits 0..8, as soon as a term would be the duplicate of an earlier term (or for all n >= 613). Then one would have, e.g., a(613) = prime(134_9)^1 = 13491.

Sequence A067599 is based on the same idea, but uses the primes instead of their indices. In A037276 the prime factors are repeated, instead of giving the exponent. In A080670 exponents 1 are omitted. In A124010 only the prime signature is given. In A054841 the sum e_i*10^(i-1) is given, i.e., exponents are used as digits in base 10, while they are listed individually in the rows of A067255.

LINKS

Table of n, a(n) for n=1..51.

EXAMPLE

2 = prime(1)^1 => a(2) = 11,

3 = prime(2)^1 => a(3) = 21,

4 = prime(1)^2 => a(4) = 12,

5 = prime(3)^1 => a(5) = 31,

6 = prime(1)^1*prime(2)^1 => a(1) = 1121,

7 = prime(3)^1 => a(7) = 41,

8 = prime(1)^3 => a(8) = 13, and so on.

MAPLE

a:= n-> `if`(n=1, 0, parse(cat(seq([numtheory[pi]

       (i[1]), i[2]][], i=sort(ifactors(n)[2]))))):

seq(a(n), n=1..60);  # Alois P. Heinz, Mar 16 2018

MATHEMATICA

Array[FromDigits@ Flatten@ Map[{PrimePi@ #1, #2} & @@ # &, FactorInteger@ #] &, 51] (* Michael De Vlieger, Mar 16 2018 *)

PROG

(PARI) A299400(n)=if(n=factor(n), eval(concat(apply(f->Str(primepi(f[1]), f[2]), Col(n)~))))

CROSSREFS

Cf. A067599 (decimal encoding of prime factorization).

Sequence in context: A071161 A125886 A067574 * A300296 A327246 A096312

Adjacent sequences:  A299397 A299398 A299399 * A299401 A299402 A299403

KEYWORD

nonn,base

AUTHOR

M. F. Hasler, Mar 08 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 13:47 EST 2020. Contains 331113 sequences. (Running on oeis4.)