A305900 -id:A305900 - cp's OEIS frontend

A305902 Restricted growth sequence transform of A305900(A048673(n)).

1, 2, 3, 4, 5, 6, 7, 8, 4, 4, 4, 4, 9, 4, 10, 4, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 4, 4, 24, 25, 4, 26, 4, 27, 28, 4, 29, 30, 4, 31, 4, 32, 33, 34, 35, 4, 36, 37, 38, 39, 40, 41, 4, 42, 4, 4, 43, 44, 45, 46, 47, 48, 49, 50, 51, 4, 52, 4, 53, 54, 55, 56, 57, 58, 59, 60, 61, 4, 62, 63, 64, 4, 4, 65, 66, 67, 4, 68, 4, 69, 70, 71, 72, 73, 74, 4

Offset: 1

Antti Karttunen, Jun 14 2018

nonn

For all i, j:
  a(i) = a(j) => A278224(i) = A278224(j).
  a(i) = a(j) => A286583(i) = A286583(j).
  a(i) = a(j) => A292251(i) = A292251(j).

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A048673, A305900.

Cf. also A305901.

up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A305900(n) = if(n<=5,n,if(isprime(n),5,3+n-primepi(n)));
v305902 = rgs_transform(vector(up_to,n,A305900(A048673(n))));
A305902(n) = v305902[n];

A305801 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is an odd prime, with f(n) = n for all other n.

Original entry on oeis.org

1, 2, 3, 4, 3, 5, 3, 6, 7, 8, 3, 9, 3, 10, 11, 12, 3, 13, 3, 14, 15, 16, 3, 17, 18, 19, 20, 21, 3, 22, 3, 23, 24, 25, 26, 27, 3, 28, 29, 30, 3, 31, 3, 32, 33, 34, 3, 35, 36, 37, 38, 39, 3, 40, 41, 42, 43, 44, 3, 45, 3, 46, 47, 48, 49, 50, 3, 51, 52, 53, 3, 54, 3, 55, 56, 57, 58, 59, 3, 60, 61, 62, 3, 63, 64, 65, 66, 67, 3, 68, 69, 70, 71, 72, 73, 74, 3, 75, 76, 77, 3, 78, 3, 79, 80

Offset: 1

Antti Karttunen, Jun 14 2018

nonn

The original name was: "Filter sequence for a(odd prime) = constant sequences", which stemmed from the fact that for all i, j, a(i) = a(j) => b(i) = b(j) for any sequence b that obtains a constant value for all odd primes A065091.
For example, we have for all i, j:
  a(i) = a(j) => A305800(i) = A305800(j),
  a(i) = a(j) => A007814(i) = A007814(j),
  a(i) = a(j) => A305891(i) = A305891(j) => A291761(i) = A291761(j).
There are several filter sequences "above" this one (meaning that they have finer equivalence class partitioning), for example, we have, for all i, j:
[where odd primes are further distinguished by]
  A305900(i) = A305900(j) => a(i) = a(j),   [whether p = 3 or > 3]
  A319350(i) = A319350(j) => a(i) = a(j),   [A007733(p)]
  A319704(i) = A319704(j) => a(i) = a(j),   [p mod 4]
  A319705(i) = A319705(j) => a(i) = a(j),   [A286622(p)]
  A331304(i) = A331304(j) => a(i) = a(j),   [parity of A000720(p)]
  A336855(i) = A336855(j) => a(i) = a(j).   [distance to the next larger prime]

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A000720, A065091, A305800, A305900.
Cf. A305900, A319350, A319704, A319705, A331304, A336855 (sequences with finer equivalence class partitioning).
Cf. A305800, A305890, A305891, A305896, A318500, A318888, A319346, A319347, A319349, A319701, A322591, A322809, A322810, A323078, A323367, A323082, A323369, A323370, A323371, A323374, A323400, A324401, A326199, A326201, A326203, A326203, A328470, A329608, A331174, A331730, A331301 (sequences with coarser equivalence class partitioning).
Cf. also A003602, A103391, A295300, A305795, A324400, A331300, A336460 (for similar constructions or similarly useful sequences).

Array[If[# <= 2, #, If[PrimeQ[#], 3, 2 + # - PrimePi[#]]] &, 105] (* Michael De Vlieger, Oct 18 2021 *)

A305801(n) = if(n<=2,n,if(isprime(n),3,2+n-primepi(n)));

a(1) = 1, a(2) = 2; for n > 2, a(n) = 3 for odd primes, and a(n) = 2+n-A000720(n) for composite n.

For n > 2, a(n) = 1 + A305800(n).

Name changed and Comment section rewritten by Antti Karttunen, Oct 17 2021

A305800 Filter sequence for a(prime) = constant sequences.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 5, 6, 7, 2, 8, 2, 9, 10, 11, 2, 12, 2, 13, 14, 15, 2, 16, 17, 18, 19, 20, 2, 21, 2, 22, 23, 24, 25, 26, 2, 27, 28, 29, 2, 30, 2, 31, 32, 33, 2, 34, 35, 36, 37, 38, 2, 39, 40, 41, 42, 43, 2, 44, 2, 45, 46, 47, 48, 49, 2, 50, 51, 52, 2, 53, 2, 54, 55, 56, 57, 58, 2, 59, 60, 61, 2, 62, 63, 64, 65, 66, 2, 67, 68, 69, 70, 71, 72, 73, 2, 74, 75, 76, 2, 77, 2, 78, 79, 80, 2, 81, 2, 82, 83, 84, 2, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96

Offset: 1

Antti Karttunen, Jun 14 2018

nonn

Restricted growth sequence transform of A239968.
In the following, A stands for this sequence, A305800, and S -> T (where S and T are sequence A-numbers) indicates that for all i, j: S(i) = S(i) => T(i) = T(j).
For example, the following implications hold:
  A -> A300247 -> A305897 -> A077462 -> A101296,
  A -> A290110 -> A300250 -> A101296.

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A000720, A239968.
Differs from A296073 for the first time at n=125, as a(125) = 96, while A296073(125) = 33.
Cf. also A305900, A305801, A295300, A289626 for other "upper level" filters.

Join[{1},Table[If[PrimeQ[n],2,1+n-PrimePi[n]],{n,2,150}]] (* Harvey P. Dale, Jul 12 2019 *)

A305800(n) = if(1==n,n,if(isprime(n),2,1+n-primepi(n)));

a(1) = 1; for n > 1, a(n) = 2 for prime n, and a(n) = 1+n-A000720(n) for composite n.

A295300 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A003557(n), A046523(n), A048250(n)].

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 44, 49, 50, 51, 44, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 58, 62, 65, 66, 67, 68, 69, 70, 58, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 80

Offset: 1

Antti Karttunen, Nov 19 2017

nonn

Restricted growth sequence transform of A291752.
For all i, j:
  a(i) = a(j) => A291751(i) = A291751(j),
  a(i) = a(j) => A326199(i) = A326199(j) => A294877(i) = A294877(j),
  a(i) = a(j) => A322021(i) = A322021(j),
  a(i) = a(j) => A295888(i) = A295888(j),
  a(i) = a(j) => A296090(i) = A296090(j).

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A003557, A046523, A048250, A101296, A286360, A291750, A291751, A291752, A291757, A291758, A295888, A296090, A322021, A326199.

Cf. also A305801, A305900, A323368, A324400.

up_to = 100000;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A003557(n) = n/factorback(factor(n)[, 1]); \\ From A003557
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A048250(n) = if(n<1, 0, sumdiv(n, d, if(core(d)==d, d)));
A291750(n) = (1/2)*(2 + ((A003557(n)+A048250(n))^2) - A003557(n) - 3*A048250(n));
Aux295300(n) = (1/2)*(2 + ((A046523(n) + A291750(n))^2) - A046523(n) - 3*A291750(n));
v295300 = rgs_transform(vector(up_to,n,Aux295300(n)));
A295300(n) = v295300[n];

Name changed and the comments section added by Antti Karttunen, Jul 13 2019

A322026 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j) and A007949(i) = A007949(j), for all i, j, where A007814 and A007949 give the 2- and 3-adic valuations of n.

Original entry on oeis.org

1, 2, 3, 4, 1, 5, 1, 6, 7, 2, 1, 8, 1, 2, 3, 9, 1, 10, 1, 4, 3, 2, 1, 11, 1, 2, 12, 4, 1, 5, 1, 13, 3, 2, 1, 14, 1, 2, 3, 6, 1, 5, 1, 4, 7, 2, 1, 15, 1, 2, 3, 4, 1, 16, 1, 6, 3, 2, 1, 8, 1, 2, 7, 17, 1, 5, 1, 4, 3, 2, 1, 18, 1, 2, 3, 4, 1, 5, 1, 9, 19, 2, 1, 8, 1, 2, 3, 6, 1, 10, 1, 4, 3, 2, 1, 20, 1, 2, 7, 4, 1, 5, 1, 6, 3

Offset: 1

Antti Karttunen, Dec 03 2018

nonn

Restricted growth sequence transform of the ordered pair [A007814(n), A007949(n)].
For all i, j:
  A305900(i) = A305900(j) => a(i) = a(j),
  a(i) = a(j) => A122841(i) = A122841(j),
  a(i) = a(j) => A244417(i) = A244417(j),
  a(i) = a(j) => A322316(i) = A322316(j) => A072078(i) = A072078(j).
If and only if a(k) > a(i) for all k > i then k is in A003586, - David A. Corneth, Dec 03 2018
That is, A003586 gives the positions of records (1, 2, 3, 4, 5, ...) in this sequence.
Sequence A126760 (without its initial zero) and this sequence are ordinal transforms of each other.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Jon Maiga, Computer-generated formulas for A322026, Sequence Machine.

Cf. A003586 (positions of records, the first occurrence of n), A007814, A007949, A065331, A071521, A072078, A087465, A122841, A126760 (ordinal transform), A322316, A323883, A323884.

Cf. also A247714 and A255975.

up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A007814(n) = valuation(n,2);
A007949(n) = valuation(n,3);
v322026 = rgs_transform(vector(up_to, n, [A007814(n), A007949(n)]));
A322026(n) = v322026[n];

A065331(n) = (3^valuation(n, 3)<A065331
A071521(n) = { my(t=1/3); sum(k=0, logint(n, 3), t*=3; logint(n\t, 2)+1); }; \\ From A071521.
A322026(n) = A071521(A065331(n)); \\ Antti Karttunen, Sep 08 2024

For s = A003586(n), a(s) = n = a((6k+1)*s) = a((6k-1)*s), where s is the n-th 3-smooth number and k > 0. - David A. Corneth, Dec 03 2018
A065331(n) = A003586(a(n)). - David A. Corneth, Dec 04 2018
From Antti Karttunen, Sep 08 2024: (Start)
a(n) = Sum{k=1..n} [A126760(k)==A126760(n)], where [ ] is the Iverson bracket.
a(n) = A071521(A065331(n)). [Found by Sequence Machine and also by LODA miner]
a(n) = A323884(25*n). [Conjectured by Sequence Machine]
(End)

A305901 Filter sequence for all such sequences b, for which b(A006254(k)) = constant for all k >= 3.

Original entry on oeis.org

1, 2, 3, 4, 5, 4, 4, 6, 4, 4, 7, 4, 8, 9, 4, 4, 10, 11, 4, 12, 4, 4, 13, 4, 14, 15, 4, 16, 17, 4, 4, 18, 19, 4, 20, 4, 4, 21, 22, 4, 23, 4, 24, 25, 4, 26, 27, 28, 4, 29, 4, 4, 30, 4, 4, 31, 4, 32, 33, 34, 35, 36, 37, 4, 38, 4, 39, 40, 4, 4, 41, 42, 43, 44, 4, 4, 45, 46, 4, 47, 48, 4, 49, 4, 50, 51, 4, 52, 53, 4, 4, 54, 55, 56, 57, 4, 4, 58, 4, 4, 59, 60, 61

Offset: 1

Antti Karttunen, Jun 14 2018

nonn

Restricted growth sequence transform of A305900(A064216(n)).
For all i, j:
  a(i) = a(j) => A278223(i) = A278223(j).
  a(i) = a(j) => A253786(i) = A253786(j).

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A006254, A064216, A305900.

Cf. also A305902.

up_to = 1000;
partialsums(f,up_to) = { my(v = vector(up_to), s=0); for(i=1,up_to,s += f(i); v[i] = s); (v); }
v_partsums = partialsums(x -> isprime(x+x-1), up_to);
A305901(n) = if(n<=3,n,if(isprime(n+n-1),4,3+n-v_partsums[n]));

For n <= 3, a(n) = n, and for n >= 4, a(n) = 4 if 2n-1 is a prime (for all n in A006254[3..] = 4, 6, 7, 9, 10, 12, 15, ...), and for all other n (numbers n such that 2n-1 is composite), a(n) = running count from 5 onward.

A305810 Filter sequence for a(Sophie Germain primes > 3) = constant sequences.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 5, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 5, 22, 23, 24, 25, 26, 5, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 5, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 5, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 5, 78, 79, 80, 81, 82, 5, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 5

Offset: 1

Antti Karttunen, Jun 16 2018

nonn

Filer sequence for all such sequences S, for which S(A005384(k)) = constant for all k >= 3.
Restricted growth sequence transform of the ordered pair [A305900(n), A305901(1+n)].
For all i, j:
  a(i) = a(j) => A305900(i) = A305900(j),
  a(i) = a(j) => A305901(1+i) = A305901(1+j),
  a(i) = a(j) => A305978(i) = A305978(j),
  a(i) = a(j) => A305985(i) = A305985(j).

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A005384, A156660, A156874, A305900, A305901, A305978, A305985.

up_to = 100000;
A156660(n) = (isprime(n)&&isprime(2*n+1)); \\ From A156660
partialsums(f,up_to) = { my(v = vector(up_to), s=0); for(i=1,up_to,s += f(i); v[i] = s); (v); }
v156874 = partialsums(A156660, up_to);
A156874(n) = v156874[n];
A305810(n) = if(n<5,n,if(A156660(n),5,3+n-A156874(n)));

If n < 5, a(n) = n; for n >= 5, a(n) = 5 if A156660(n) == 1 [when n is in A005384[3..] = 5, 11, 23, 29, 41, 53, 83, 89, 113, ...], otherwise a(n) = 3+n-A156874(n).

A305893 Filter sequence combining 3-adic valuation (A007949) and the prime signature (A046523) of n.

Original entry on oeis.org

1, 2, 3, 4, 2, 5, 2, 6, 7, 8, 2, 9, 2, 8, 5, 10, 2, 11, 2, 12, 5, 8, 2, 13, 4, 8, 14, 12, 2, 15, 2, 16, 5, 8, 8, 17, 2, 8, 5, 18, 2, 15, 2, 12, 11, 8, 2, 19, 4, 12, 5, 12, 2, 20, 8, 18, 5, 8, 2, 21, 2, 8, 11, 22, 8, 15, 2, 12, 5, 23, 2, 24, 2, 8, 9, 12, 8, 15, 2, 25, 26, 8, 2, 21, 8, 8, 5, 18, 2, 27, 8, 12, 5, 8, 8, 28, 2, 12, 11, 29, 2, 15, 2, 18, 15

Offset: 1

Antti Karttunen, Jun 14 2018

nonn

Restricted growth sequence transform of A286463, of the ordered pair [A007949(n), A046523(n)].

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A007949, A046523, A286463, A305900.

Cf. also A305891.

up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A007949(n) = valuation(n,3);
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
Aux305893(n) = [A007949(n), A046523(n)];
v305893 = rgs_transform(vector(up_to,n,Aux305893(n)));
A305893(n) = v305893[n];

A319705 Filter sequence which for primes p records a distinct value for each distinct multiset formed from the lengths of 1-runs in its binary representation [A286622(p)], and for all other numbers assigns a unique number.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 13, 14, 15, 5, 16, 11, 17, 18, 19, 20, 21, 22, 23, 24, 25, 20, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 33, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 38, 48, 49, 50, 51, 52, 53, 54, 42, 55, 56, 57, 58, 59, 11, 60, 61, 62, 20, 63, 33, 64, 65, 66, 67, 68, 42, 69, 70, 71, 38, 72, 73, 74, 75, 76, 38, 77, 78, 79, 80, 81, 82, 83, 11, 84, 85, 86, 38

Offset: 1

Antti Karttunen, Sep 26 2018

nonn

Restricted growth sequence transform of function f defined as f(n) = A278222(n) when n is a prime, otherwise -n.
After its initial term 3, Fermat primes (A019434) gives the positions of 5 in this sequence, while the Mersenne primes (A000668) are each assigned to their own singleton equivalence class.
For all i, j:
  a(i) = a(j) => A305900(i) = A305900(j),
  a(i) = a(j) => A286622(i) = A286622(j),
  a(i) = a(j) => A305795(i) = A305795(j).

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A000668, A019434, A278222, A286163, A286622, A305795, A305900.

Cf. also A319704, A319706.

up_to = 100000;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A278222(n) = A046523(A005940(1+n));
A319705aux(n) = if(isprime(n),A278222(n),-n);
v319705 = rgs_transform(vector(up_to,n,A319705aux(n)));
A319705(n) = v319705[n];

A319706 Filter sequence which for primes p records the prime signature of 2p+1, and for all other numbers assigns a unique number.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 5, 6, 7, 8, 2, 9, 10, 11, 12, 13, 5, 14, 5, 15, 16, 17, 2, 18, 19, 20, 21, 22, 2, 23, 24, 25, 26, 27, 28, 29, 24, 30, 31, 32, 2, 33, 5, 34, 35, 36, 5, 37, 38, 39, 40, 41, 2, 42, 43, 44, 45, 46, 5, 47, 5, 48, 49, 50, 51, 52, 53, 54, 55, 56, 5, 57, 24, 58, 59, 60, 61, 62, 5, 63, 64, 65, 2, 66, 67, 68, 69, 70, 2, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 5

Offset: 1

Antti Karttunen, Sep 26 2018

nonn

Restricted growth sequence transform of function f defined as f(n) = A046523(2n+1) when n is a prime, otherwise -n.
For all i, j:
  A305810(i) = A305810(j) => a(i) = a(j),
and
  a(i) = a(j) => A305800(i) = A305800(j),
  a(i) = a(j) => A305978(i) = A305978(j),
  a(i) = a(j) => A305985(i) = A305985(j).

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf- A046523, A305800, A305810, A305900, A305901, A305978, A305985.

Cf. A005384 (positions of 2's), A234095 (positions of 5's).

up_to = 100000;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
A319706aux(n) = if(isprime(n),A046523(n+n+1),-n);
v319706 = rgs_transform(vector(up_to,n,A319706aux(n)));
A319706(n) = v319706[n];

cp's OEIS Frontend

A305902 Restricted growth sequence transform of A305900(A048673(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A305801 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is an odd prime, with f(n) = n for all other n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A305800 Filter sequence for a(prime) = constant sequences.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A295300 Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A003557(n), A046523(n), A048250(n)].

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Extensions

A322026 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j) and A007949(i) = A007949(j), for all i, j, where A007814 and A007949 give the 2- and 3-adic valuations of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A305901 Filter sequence for all such sequences b, for which b(A006254(k)) = constant for all k >= 3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A305810 Filter sequence for a(Sophie Germain primes > 3) = constant sequences.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A305893 Filter sequence combining 3-adic valuation (A007949) and the prime signature (A046523) of n.

Views

Author

Keywords

Comments

Links