A006530 -id:A006530 - cp's OEIS frontend

A070812 a(n) = phi(gpf(n)) - gpf(phi(n)) = A000010(A006530(n)) - A006530(A000010(n)).

0, -1, 2, 0, 3, -1, -1, 2, 5, 0, 9, 3, 2, -1, 14, -1, 15, 2, 3, 5, 11, 0, -1, 9, -1, 3, 21, 2, 25, -1, 5, 14, 3, -1, 33, 15, 9, 2, 35, 3, 35, 5, 1, 11, 23, 0, -1, -1, 14, 9, 39, -1, 5, 3, 15, 21, 29, 2, 55, 25, 3, -1, 9, 5, 55, 14, 11, 3, 63, -1, 69, 33, -1, 15, 5, 9, 65, 2, -1, 35, 41, 3, 14, 35, 21, 5, 77, 1, 9, 11, 25, 23, 15, 0, 93, -1, 5

Offset: 3

Labos Elemer, May 09 2002

sign

Value of commutator[A000010, A006530] at n.

			Cases of n when a(n) = 1, -1, 2 or 0 are listed in A070002, A070003, A070004, A007283 respectively. Further regular solutions: if a(n)=3, then n=7k, where k has prime divisors < 7; if a(n)=5, then n=11k, where k has no prime divisors >=11; if a(n)=25, then mostly (not always!) n=31k ...

Michael De Vlieger, Table of n, a(n) for n = 3..10000
Michael De Vlieger, Log log scatterplot of a(n)+2, n = 3..10^5.

Cf. A000010, A006530, A070777, A068211, A070002, A070003, A070004, A007283.

pf[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] Table[EulerPhi[pf[u]]-pf[EulerPhi[u]], {u, 3, 128}]

gpf(n)=my(f=factor(n)[,1]);f[#f]
a(n)=gpf(n)-gpf(eulerphi(n))-1 \\ Charles R Greathouse IV, Feb 19 2013

a(n) = A070777(n) - A068211(n).

A076271 a(1) = 1, a(2) = 2, and for n > 2, a(n) = a(n-1) + gpf(a(n-1)), where gpf = greatest prime factor = A006530.

Original entry on oeis.org

1, 2, 4, 6, 9, 12, 15, 20, 25, 30, 35, 42, 49, 56, 63, 70, 77, 88, 99, 110, 121, 132, 143, 156, 169, 182, 195, 208, 221, 238, 255, 272, 289, 306, 323, 342, 361, 380, 399, 418, 437, 460, 483, 506, 529, 552, 575, 598, 621, 644, 667, 696, 725, 754, 783, 812, 841

Offset: 1

Reinhard Zumkeller, Oct 04 2002

nonn

a(n+1) is the smallest number such that the largest prime divisor of a(n) is the highest common factor of a(n) and a(n+1). - Amarnath Murthy, Oct 17 2002
Essentially the same as A036441(n) = a(n+1) and A180107(n) = a(n-1) (n > 1).
The equivalent sequence with A020639 = spf instead of A006530 = gpf begins a(1) = 1, a(2) = 2, and from then on we get all even numbers: a(n) = a(2) + 2*(n-2), n > 1. - M. F. Hasler, Apr 08 2015
From David James Sycamore, Apr 27 2017: (Start)
The sequence contains only one prime; a(2)=2, all other terms (excluding a(1)=1) being composite, since if a(n) for some n > 2 is assumed to be the first prime after 2, then a(n) = a(n-1) + gpf(a(n-1))= m*q+q = q*(m+1) for some integer m > 1 and some prime q. This number is composite; contradiction. Terms after a(3)=4 alternate between even and odd values since each is created by addition of a prime (odd term).
All terms a(n) arise as consecutive multiples of consecutive primes occurring in their natural ascending order, 2,3,5,7.... (A000040). The number of (consecutive) terms which arise as multiples of p(n)= A000040(n) is 1 + p(n+1)- p(n-1), namely n-th term of the sequence: 2,4,5,7,7,7,7,7,11, etc. Example: Number of multiples of 17, the 7th prime, is 1+p(8)-p(6) = 1+19-13 = 7.
For any pair of consecutive primes, p,q (p < q) a(p+q-1) = p*q, the (semiprime) term where multiples of p end and multiples of q start. Example a(7+11-1) = a(17) = 77 = 11*7, the last multiple of 7 and first multiple of 11. Every string of multiples of prime p contains the term p^2, located at a(2*p-1). E.g.: a(3)=4, a(5)=9, a(9)=25. (End)

T. D. Noe, Table of n, a(n) for n = 1..10000

Cf. A036441, A076272(n) = a(n+1) - a(n).
See also A180107.
Cf. A070229.

a076271 n = a076271_list !! (n-1)
a076271_list = iterate a070229 1  -- Reinhard Zumkeller, Nov 07 2015

NestList[#+FactorInteger[#][[-1,1]]&,1,60] (* Harvey P. Dale, May 11 2015 *)

print1(n=1);for(i=1,199,print1(","n+=A006530(n))) \\ M. F. Hasler, Apr 08 2015

a(A076274(n)) = A008578(n)^2 for all n.

a(n+1) = A070229(a(n)). - Reinhard Zumkeller, Nov 07 2015

Edited by M. F. Hasler, Apr 08 2015

A251727 Numbers n > 1 for which gpf(n) > spf(n)^2, where spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

Original entry on oeis.org

10, 14, 20, 22, 26, 28, 30, 33, 34, 38, 39, 40, 42, 44, 46, 50, 51, 52, 56, 57, 58, 60, 62, 66, 68, 69, 70, 74, 76, 78, 80, 82, 84, 86, 87, 88, 90, 92, 93, 94, 98, 99, 100, 102, 104, 106, 110, 111, 112, 114, 116, 117, 118, 120, 122, 123, 124, 126, 129, 130, 132, 134, 136, 138, 140, 141, 142, 145, 146, 148, 150, 152

Offset: 1

Antti Karttunen, Dec 17 2014. A new simpler definition found Jan 01 2015 and the original definition moved to the Comments section

nonn

Numbers n > 1 for which the smallest r such that r^k <= spf(n) and gpf(n) < r^(k+1) [for some k >= 0] is gpf(n)+1. Here spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n). (The original, equivalent definition of the sequence).
Numbers n > 1 such that A252375(n) = 1 + A006530(n). Equally, one can substitute A251725 for A252375.
Numbers n > 1 for which there doesn't exist any r <= gpf(n) such that r^k <= spf(n) and gpf(n) < r^(k+1), for some k >= 0, where spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

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

Complement: A251726. Subsequence: A138511.
Gives the positions of zeros in A252374 following its initial term.
Cf. A252371 (difference between the prime indices of gpf and spf of each a(n)).
Cf. A006530, A020639, A252375, A251725.
Related permutations: A252757-A252758.

A046670 Partial sums of A006530.

Original entry on oeis.org

1, 3, 6, 8, 13, 16, 23, 25, 28, 33, 44, 47, 60, 67, 72, 74, 91, 94, 113, 118, 125, 136, 159, 162, 167, 180, 183, 190, 219, 224, 255, 257, 268, 285, 292, 295, 332, 351, 364, 369, 410, 417, 460, 471, 476, 499, 546, 549, 556, 561, 578, 591, 644, 647, 658, 665, 684

Offset: 1

N. J. A. Sloane

Handbook of Number Theory, D. S. Mitrinovic et al., Kluwer, Section IV.1.

T. D. Noe, Table of n, a(n) for n = 1..1000
K. Alladi and P. Erdős, On an additive arithmetic function, Pacific J. Math., Volume 71, Number 2 (1977), 275-294. MR 0447086 (56 #5401).
A. E. Brouwer, Two number theoretic sums, Stichting Mathematisch Centrum. Zuivere Wiskunde, Report ZW 19/74 (1974): 3 pages. [Cached copy, included with the permission of the author]

Cf. A006530, A046669, A104350, A360559.

a046670 n = a046670_list !! (n-1)
a046670_list = scanl1 (+) a006530_list -- Reinhard Zumkeller, Jun 15 2013

Accumulate[Prepend[Table[FactorInteger[n][[-1,1]],{n,2,100}],1]] (* Harvey P. Dale, Jun 11 2011 *)

gpf(n)=if(n<4,n,n=factor(n)[,1];n[#n])
a(n)=sum(k=1,n,gpf(k)) \\ Charles R Greathouse IV, Feb 19 2014

a(n) = Pi^2/12 * n^2/log n + O(n^2/log^2 n). [See Mitrinovic et al.] - Charles R Greathouse IV, Feb 19 2014

More terms from James Sellers

A082417 Numbers k such that P(k) < P(k+1) > P(k+2), where P(k) is the largest prime factor of k (A006530).

Original entry on oeis.org

2, 4, 6, 10, 12, 16, 18, 22, 25, 28, 30, 33, 36, 40, 42, 46, 48, 50, 52, 54, 58, 60, 64, 66, 68, 70, 72, 75, 78, 82, 85, 88, 93, 96, 98, 100, 102, 106, 108, 110, 112, 115, 117, 121, 126, 128, 130, 133, 136, 138, 141, 145, 148, 150, 154, 156, 160, 162, 166, 172, 178, 180, 182

Offset: 1

N. J. A. Sloane, Apr 25 2003

nonn

Antal Balog, On the largest prime factor of consecutive integers, Abstracts Amer. Math. Soc., 25 (No. 2, 2002), p. 337, #975-11-76.

T. D. Noe, Table of n, a(n) for n = 1..1000
P. Erdős and C. Pomerance, On the largest prime factors of n and n+1, Aequationes Math. 17 (1978), p. 311-321. [alternate link]

Cf. A006530, A082418-A082422, A071869, A071870, A100392.

gpf[n_] := FactorInteger[n][[-1, 1]]; ind = Position[Differences[Array[gpf, 200]], ?(# > 0 &)] // Flatten; ind[[Position[Differences[ind], ?(# > 1 &)] // Flatten]] (* Amiram Eldar, Jun 06 2022 *)

a(n) = A100392(n) - 1. - T. D. Noe, Nov 26 2007

A072268 a(0)=1; a(n+1) = 1 + f(a(n))^2, where f(x) is the largest prime factor of x (A006530).

Original entry on oeis.org

1, 2, 5, 26, 170, 290, 842, 177242, 160802, 2810, 78962, 9223370, 5033760602, 2935496262242, 2154284576409188208716642, 1379590379356276893461978662419832989306970202, 10320758390549056348725939119133160378521185060950774444682

Offset: 0

Reinhard Zumkeller, Jul 08 2002

nonn

Is the sequence bounded?

Essentially the same as A031439; a(n) = A031439(n-1)^2 + 1. - Charles R Greathouse IV, May 08 2009

			Given a(5)=290: a(6) = 1 + lpf(a(5))^2 = 1 + lpf(290)^2 = 1 + 29^2 = 842.

Cf. A031439.

with(numtheory): a[0]:=1: a[1]:=2: for n from 2 to 20 do b:=factorset(a[n-1]): a[n]:=1+op(nops(b),b)^2: od: seq(a[n],n=0..20); # Emeric Deutsch, Feb 05 2006

NestList[1+FactorInteger[#][[-1,1]]^2&,1,17] (* Harvey P. Dale, Feb 01 2022 *)

More terms from Emeric Deutsch, Feb 05 2006

a(16) corrected by T. D. Noe, Nov 26 2007

A082422 Numbers n such that P(n) > P(n+2) > P(n+1), where P(n) = largest prime factor of n (A006530).

Original entry on oeis.org

7, 19, 23, 26, 31, 47, 53, 67, 74, 76, 83, 89, 97, 109, 113, 119, 124, 127, 131, 134, 139, 146, 159, 167, 174, 181, 183, 188, 199, 207, 211, 215, 219, 233, 244, 246, 251, 259, 263, 274, 287, 293, 303, 307, 314, 323, 327, 337, 339, 349, 353, 359, 362, 367, 379, 383, 386

Offset: 1

N. J. A. Sloane, Apr 25 2003

nonn

Antal Balog, On the largest prime factor of consecutive integers, Abstracts Amer. Math. Soc., 25 (No. 2, 2002), p. 337, #975-11-76.

T. D. Noe, Table of n, a(n) for n = 1..1000
P. Erdős and C. Pomerance, On the largest prime factors of n and n+1, Aequationes Math. 17 (1978), p. 311-321. [alternate link]

Cf. A006530, A082417-A082421, A071869, A071870.

With[{lfs=Table[FactorInteger[n][[-1,1]],{n,400}]},Flatten[ Position[ Partition[ lfs,3,1],?(#[[1]]>#[[3]]>#[[2]]&),{1},Heads->False]]] (* _Harvey P. Dale, Sep 25 2014 *)

A347240 a(n) is the largest prime factor (A006530) of all terms encountered when iterating the map x -> A000593(x), when starting from x = n, but excluding the n itself. If n is a power of 2, then a(n) = 1. If 1 is never reached, then a(n) = -1.

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 2, 1, 13, 3, 3, 2, 7, 2, 3, 1, 13, 13, 5, 3, 2, 3, 3, 2, 31, 7, 5, 2, 5, 3, 2, 1, 3, 13, 3, 13, 19, 5, 7, 3, 7, 2, 11, 3, 13, 3, 3, 2, 19, 31, 13, 7, 5, 5, 13, 2, 5, 5, 5, 3, 31, 2, 13, 1, 7, 3, 17, 13, 3, 3, 13, 13, 37, 19, 31, 5, 3, 7, 5, 3, 19, 7, 7, 2, 5, 11, 5, 3, 13, 13, 7, 3, 2, 3, 5, 2, 19

Offset: 1

Antti Karttunen, Aug 28 2021

nonn

			For n = 17, the iteration proceeds as follows 17 -> 18 (= 2*3*3), 18 -> 13 (13 is a prime), 13 -> 14 (= 2*7), 14 -> 8 (= 2*2*2), 8 -> 1. The largest prime factor present after the initial step is 13, thus a(17) = 13.

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

Cf. A000593, A006530, A336361, A347241, A347242, A347243, A347244.

Cf. also A161942.

A006530(n) = if(1==n, n, my(f=factor(n)); f[#f~, 1]);
A000265(n) = (n >> valuation(n, 2));
A000593(n) = sigma(A000265(n));
A347240(n) = { my(m=1); while(n>1, n = A000593(n); m = max(m, A006530(n))); (m); };

a(n) = A347241(A000593(n)). - Antti Karttunen, Feb 10 2022

A252375 a(n) = smallest r such that r^k <= spf(n) and gpf(n) < r^(k+1), for some k >= 0, where spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 8, 3, 2, 2, 2, 2, 6, 3, 12, 2, 2, 2, 14, 2, 8, 2, 6, 2, 2, 12, 18, 2, 2, 2, 20, 14, 6, 2, 8, 2, 12, 3, 24, 2, 2, 2, 6, 18, 14, 2, 2, 4, 8, 20, 30, 2, 6, 2, 32, 3, 2, 4, 12, 2, 18, 24, 8, 2, 2, 2, 38, 3, 20, 4, 14, 2, 6, 2, 42, 2, 8, 5, 44, 30, 12, 2, 6, 4, 24, 32

Offset: 1

Antti Karttunen, Dec 17 2014

nonn

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

A252374 gives the corresponding exponents.
Cf. A251726 (those n for which a(n) <= A006530(n)).
Cf. A251727 (those n > 1 for which a(n) = A006530(n)+1).
Cf. A006530, A020639, A066048, A138510, A251725.

(define (A252375 n) (let ((spf (A020639 n)) (gpf (A006530 n))) (let outerloop ((r 2)) (let innerloop ((rx 1)) (cond ((and (<= rx spf) (< gpf (* r rx))) r) ((<= rx spf) (innerloop (* r rx))) (else (outerloop (+ 1 r))))))))
(define (A252375 n) (let ((x (A251725 n))) (if (= 1 x) 2 x))) ;; Alternatively, using the implementation of A251725.

If A251725(n) = 1, a(n) = 2, otherwise a(n) = A251725(n).
Other identities. For all n >= 1:
a(n) = a(A066048(n)). [The result depends only on the smallest and the largest prime factor of n.]

A341607 Square array A(n,k) = A006530(A017666(A246278(n,k))), read by falling antidiagonals.

Original entry on oeis.org

2, 2, 3, 1, 3, 5, 2, 5, 5, 7, 5, 3, 7, 7, 11, 3, 7, 5, 11, 11, 13, 7, 5, 11, 7, 13, 13, 17, 2, 11, 7, 13, 11, 17, 17, 19, 3, 3, 13, 11, 17, 13, 19, 19, 23, 5, 5, 5, 17, 13, 19, 17, 23, 23, 29, 11, 7, 7, 7, 19, 17, 23, 19, 29, 29, 31, 2, 13, 11, 11, 11, 23, 19, 29, 23, 31, 31, 37, 13, 3, 17, 13, 13, 13, 29, 23, 31, 29, 37, 37, 41

Offset: 1

Antti Karttunen, Feb 16 2021

			The top left corner of the array:
   n=   1   2   3   4   5   6   7   8   9  10  11  12   13  14  15  16   17
  2n=   2   4   6   8  10  12  14  16  18  20  22  24   26  28  30  32   34
-----+----------------------------------------------------------------------
   1 |  2,  2,  1,  2,  5,  3,  7,  2,  3,  5, 11,  2,  13,  1,  5,  2,  17,
   2 |  3,  3,  5,  3,  7,  5, 11,  3,  5,  7, 13,  3,  17, 11,  7,  3,  19,
   3 |  5,  5,  7,  5, 11,  7, 13,  5,  7, 11, 17,  7,  19, 13, 11,  5,  23,
   4 |  7,  7, 11,  7, 13, 11, 17,  7, 11, 13, 19, 11,  23, 17, 13,  7,  29,
   5 | 11, 11, 13, 11, 17, 13, 19, 11, 13, 17, 23, 13,  29,*11, 17, 11,  31,
   6 | 13, 13, 17, 13, 19, 17, 23, 13, 17, 19, 29,*13,  31, 23, 19, 13,  37,
   7 | 17, 17, 19, 17, 23, 19, 29, 17, 19, 23, 31, 19,  37, 29, 23, 17,  41,
   8 | 19, 19, 23, 19, 29, 23, 31, 19, 23, 29, 37, 23,  41, 31, 29, 19,  43,
   9 | 23, 23, 29, 23, 31, 29, 37, 23, 29, 31, 41, 29,  43, 37, 31, 23,  47,
  10 | 29, 29, 31, 29, 37, 31, 41, 29, 31, 37, 43, 31,  47, 41, 37, 29,  53,
  11 | 31, 31, 37, 31, 41, 37, 43, 31, 37, 41, 47,*31,  53, 43, 41, 31,  59,
  12 | 37, 37, 41, 37, 43, 41, 47, 37, 41, 43, 53, 41,  59, 47, 43, 37,  61,
  13 | 41, 41, 43, 41, 47, 43, 53, 41, 43, 47, 59, 43,  61, 53, 47, 41,  67,
  14 | 43, 43, 47, 43, 53, 47, 59, 43, 47, 53, 61, 47,  67, 59, 53, 43,  71,
  15 | 47, 47, 53, 47, 59, 53, 61, 47, 53, 59, 67, 53,  71, 47, 59, 47,  73,
  16 | 53, 53, 59, 53, 61, 59, 67, 53, 59, 61, 71, 59,  73, 67, 61, 53,  79,
  17 | 59, 59, 61, 59, 67, 61, 71, 59, 61, 67, 73, 61,  79, 71, 67, 59,  83,
  18 | 61, 61, 67, 61, 71, 67, 73, 61, 67, 71, 79, 67,  83, 73, 71, 61,  89,
  19 | 67, 67, 71, 67, 73, 71, 79, 67, 71, 73, 83, 71,  89, 79, 73, 67,  97,
  20 | 71, 71, 73, 71, 79, 73, 83, 71, 73, 79, 89, 73,  97, 83, 79, 71, 101,
  21 | 73, 73, 79, 73, 83, 79, 89, 73, 79, 83, 97, 79, 101, 89, 83, 73, 103,
etc.
Positions where columns are not strictly monotonic are marked with an asterisk (*). See the example section of A341606 for further elaboration.

Cf. A006530, A017666, A246278, A341606, A341608, A341628.

up_to = 105;
A246278sq(row,col) = if(1==row,2*col, my(f = factor(2*col)); for(i=1, #f~, f[i,1] = prime(primepi(f[i,1])+(row-1))); factorback(f));
A006530(n) = if(n>1, vecmax(factor(n)[, 1]), 1);
A017666(n) = denominator(sigma(n)/n);
A341607sq(row,col) = A006530(A017666(A246278sq(row,col)));
A341607list(up_to) = { my(v = vector(up_to), i=0); for(a=1,oo, for(col=1,a, i++; if(i > up_to, return(v)); v[i] = A341607sq(col,(a-(col-1))))); (v); };
v341607 = A341607list(up_to);
A341607(n) = v341607[n];

A(n,k) = A006530(A341606(n, k)) = A006530(A017666(A246278(n,k))).

cp's OEIS Frontend

A070812 a(n) = phi(gpf(n)) - gpf(phi(n)) = A000010(A006530(n)) - A006530(A000010(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A076271 a(1) = 1, a(2) = 2, and for n > 2, a(n) = a(n-1) + gpf(a(n-1)), where gpf = greatest prime factor = A006530.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A251727 Numbers n > 1 for which gpf(n) > spf(n)^2, where spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

Views

Author

Keywords

Comments

Links

Crossrefs

A046670 Partial sums of A006530.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A082417 Numbers k such that P(k) < P(k+1) > P(k+2), where P(k) is the largest prime factor of k (A006530).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Formula

A072268 a(0)=1; a(n+1) = 1 + f(a(n))^2, where f(x) is the largest prime factor of x (A006530).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Extensions

A082422 Numbers n such that P(n) > P(n+2) > P(n+1), where P(n) = largest prime factor of n (A006530).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

A347240 a(n) is the largest prime factor (A006530) of all terms encountered when iterating the map x -> A000593(x), when starting from x = n, but excluding the n itself. If n is a power of 2, then a(n) = 1. If 1 is never reached, then a(n) = -1.

Views

Author

Keywords