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-2 of 2 results.

A335817 a(k) is the index of the first occurrence of 2*k-1 in A208884, or 0 if it does not occur.

Original entry on oeis.org

1, 2, 13, 4, 6, 75, 22975, 11, 15, 10, 1417, 37, 17, 12, 573, 19, 16, 49, 28, 227, 34, 18, 26, 31, 1371, 20, 41, 36, 8181, 339, 38, 30, 40, 207, 43, 70, 1113, 91, 235, 32, 63, 203, 50, 60, 103, 48, 189, 42, 421, 57, 74, 98, 65, 259, 11997, 155, 44, 54, 199, 67
Offset: 1

Views

Author

Giovanni Resta, Jun 25 2020

Keywords

Comments

It is conjectured that A208884 contains all the odd numbers. If so, a(n) > 0 for every n.

Examples

			The first terms of A208884 are 1, 3, 3, 7, 3, so a(2*1-1) = 1, a(2*2-1) = 2, and a(2*4-1) = 4.
		

Crossrefs

Cf. A208884.

Programs

  • Mathematica
    b[1]=1; b[n_] := b[n] = #/2^IntegerExponent[#, 2] &@ (n + b[n-1]); A = Transpose@ {b /@ #, #} &@ Range[25000]; A = DeleteDuplicatesBy[ Sort@ A, First]; Last /@ TakeWhile[ A, A[[ (First[#] + 1)/2, 1]] == First@# &]

A331409 a(1)=1; for n>1, a(n) = a(n-1)+n, divided by its largest prime factor.

Original entry on oeis.org

1, 1, 2, 2, 1, 1, 4, 4, 1, 1, 4, 8, 3, 1, 8, 8, 5, 1, 4, 8, 1, 1, 8, 16, 1, 9, 12, 8, 1, 1, 16, 16, 7, 1, 12, 16, 1, 3, 6, 2, 1, 1, 4, 16, 1, 1, 16, 32, 27, 7, 2, 18, 1, 5, 12, 4, 1, 1, 12, 24, 5, 1, 32, 32, 1, 1, 4, 24, 3, 1, 24, 32, 15, 1, 4, 16, 3, 27, 2, 2, 1, 1, 12, 32, 9
Offset: 1

Views

Author

Ali Sada, Jan 16 2020

Keywords

Examples

			For n=4, a(4) = 2+4 divided by its largest prime factor = 6/3 = 2.
		

Crossrefs

Cf. A006530 (largest prime factor), A208884.

Programs

  • Magma
    [n eq 1 select 1 else (Self(n-1)+n) div Max(PrimeDivisors(Self(n-1)+n)): n in [1..85]]; // Marius A. Burtea, Feb 17 2020
    
  • Mathematica
    f[n_] := n/FactorInteger[n][[-1, 1]]; a[1] = 1; a[n_] := a[n] = f[a[n - 1] + n]; Array[a, 100] (* Amiram Eldar, Jan 16 2020 *)
    nxt[{n_,a_}]:={n+1,(a+n+1)/FactorInteger[a+n+1][[-1,1]]}; NestList[nxt,{1,1},90][[All,2]] (* Harvey P. Dale, Nov 12 2022 *)
  • PARI
    a(n) = if (n==1, 1, my(x=a(n-1)+n); x/vecmax(factor(x)[,1])); \\ Michel Marcus, Feb 20 2020
Showing 1-2 of 2 results.