cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A078310 a(n) = n*rad(n) + 1, where rad = A007947 (squarefree kernel).

Original entry on oeis.org

2, 5, 10, 9, 26, 37, 50, 17, 28, 101, 122, 73, 170, 197, 226, 33, 290, 109, 362, 201, 442, 485, 530, 145, 126, 677, 82, 393, 842, 901, 962, 65, 1090, 1157, 1226, 217, 1370, 1445, 1522, 401, 1682, 1765, 1850, 969, 676, 2117, 2210, 289, 344, 501, 2602, 1353
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 23 2002

Keywords

Comments

A112526(a(n) - 1) = 1, see also A224866. - Reinhard Zumkeller, Jul 23 2013
Increase each exponent in the prime factorization by one, then add 1 to the new product. - M. F. Hasler, Jan 22 2017

Links

Crossrefs

Smallest, greatest factor: A078311, A078312, number of factors: A078313, A078314, min, max exponent: A078315, A078316, number, sum of divisors: A078317, A078318, sum of prime factors: A078319, A078320, Euler's totient: A078321, squarefree kernel: A078322, arithmetic derivative: A078323.
Cf. primes: A078324, squarefree: A078325, squareful: A078326.

Programs

  • Haskell
    a078310 n = n * a007947 n + 1
-- Reinhard Zumkeller, Jul 23 2013, Oct 19 2011
  • Maple
    a:= n-> 1+n*mul(i[1], i=ifactors(n)[2]):
seq(a(n), n=1..60);  # Alois P. Heinz, Jan 22 2017
  • Mathematica
    A078310[n_] := n*Times @@ FactorInteger[n][[All, 1]] + 1; Array[A078310, 50] (* G. C. Greubel, Apr 25 2017 *)
  • PARI
    rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])
a(n)=n*rad(n)+1 \\ Charles R Greathouse IV, Jul 09 2013
  • PARI
    a(n)={n=factor(n);n[,2]+=vectorv(matsize(n)[1],i,1);factorback(n)+1} \\ M. F. Hasler, Jan 22 2017
  • PARI
    a(n)=prod(k=1,matsize(n=factor(n))[1],n[k,1]^(n[k,2]+1))+1 \\ M. F. Hasler, Jan 22 2017

Formula

a(n) = A064549(n)+1.

A078325 Squarefree numbers of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).

Original entry on oeis.org

2, 5, 10, 17, 26, 33, 37, 65, 73, 82, 101, 109, 122, 129, 145, 170, 197, 201, 217, 226, 257, 290, 362, 393, 401, 433, 442, 485, 501, 530, 577, 626, 649, 677, 730, 785, 842, 865, 901, 962, 969, 973, 1001, 1090, 1126, 1153, 1157, 1226, 1297, 1353, 1370, 1373
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 23 2002

Keywords

Links

Crossrefs

Intersection of A005117 and A224866.
Cf. A008966, A078310, A078324.

Programs

  • Haskell
    a078325 n = a078325_list !! (n-1)
a078325_list = filter ((== 1) . a008966) a224866_list
-- Reinhard Zumkeller, Jul 23 2013
  • Mathematica
    powQ[n_] := n == 1 || AllTrue[FactorInteger[n][[;; , 2]], # > 1 &]; Select[Range[1400], SquareFreeQ[#] && powQ[# - 1] &] (* Amiram Eldar, Jul 31 2022 *)
  • PARI
    is(n) = n>1 && issquarefree(n) && ispowerful(n-1); \\ Amiram Eldar, Jul 31 2022

A224866 Numbers of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).

Original entry on oeis.org

2, 5, 9, 10, 17, 26, 28, 33, 37, 50, 65, 73, 82, 101, 109, 122, 126, 129, 145, 170, 197, 201, 217, 226, 244, 257, 289, 290, 325, 344, 362, 393, 401, 433, 442, 485, 501, 513, 530, 577, 626, 649, 676, 677, 730, 785, 801, 842, 865, 901, 962, 969, 973, 1001
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 23 2013

Keywords

Comments

A078310 in natural order.

Links

Crossrefs

Subsequences: A078325, A078324.
Cf. A001694, A078310, A007947.

Programs

  • Haskell
    a224866 n = a224866_list !! (n-1)
a224866_list = [x | x <- [2..] , let x' = x - 1, let k = a007947 x',
                    let (y,m) = divMod x' k, m == 0, a007947 y == k]
  • Mathematica
    powQ[n_] := n == 1 || AllTrue[FactorInteger[n][[;; , 2]], # > 1 &]; Select[Range[1001], powQ[# - 1] &] (* Amiram Eldar, Jul 31 2022 *)
  • PARI
    is(n) = n>1 && ispowerful(n-1) \\ Charles R Greathouse IV, Aug 08 2013, corrected by Amiram Eldar, Jul 31 2022

Formula

a(n) = A001694(n) + 1.

A359749 Numbers k such that k and k+1 do not share a common exponent in their prime factorizations.

Original entry on oeis.org

1, 3, 4, 7, 8, 9, 15, 16, 24, 25, 26, 27, 31, 32, 35, 36, 48, 63, 64, 71, 72, 81, 100, 107, 108, 120, 121, 124, 125, 127, 128, 143, 144, 168, 169, 195, 196, 199, 200, 215, 216, 224, 225, 242, 243, 255, 256, 287, 289, 323, 342, 361, 391, 392, 399, 400, 431, 432, 440
Offset: 1

Views

Author

Amiram Eldar, Jan 13 2023

Keywords

Comments

Either k or k+1 is a powerful number (A001694). Except for k=8, are there terms k such that both k and k+1 are powerful (i.e., terms that are also in A060355)? None of the terms A060355(n) for n = 2..39 is in this sequence.
A002496(k)-1, A078324(k)-1, A078325(k)-1, and A049533(k)^2 are terms for all k >= 1.

Examples

			3 is a term since 3 has the exponent 1 in its prime factorization, and 3 + 1 = 4 = 2^2 has a different exponent in its prime factorization, 2.

Links

Crossrefs

Subsequences: A000079, A000225 \ {0}, A075408, A359747.
Cf. A001694, A002496, A049533, A060355, A078324, A078325.

Programs

  • Mathematica
    q[n_] := UnsameQ @@ Join @@ (Union[FactorInteger[#][[;; , 2]]]& /@ (n + {0, 1})); Join[{1}, Select[Range[400], q]]
  • PARI
    lista(nmax) = {my(e1 = [], e2); for(n = 2, nmax, e2 = Set(factor(n)[,2]); if(setintersect(e1, e2) == [], print1(n-1, ", ")); e1 = e2); }
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.