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.

A369871 a(n) = least prime factor of A024411(n).

Original entry on oeis.org

2, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 5, 2, 3, 3, 2, 2, 5, 3, 2, 2, 3, 5, 2, 2, 2, 3, 2, 3, 5, 2, 7, 2, 3, 2, 3, 2, 7, 3, 2, 2, 3, 5, 3, 2, 2, 5, 2, 3, 2, 7, 2, 3, 2, 2, 5, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 3, 7, 2, 5, 3, 2, 3, 5, 2, 7, 3, 2, 3, 2, 3, 2, 5, 2, 3
Offset: 1

Views

Author

Clark Kimberling, Feb 03 2024

Keywords

Comments

Conjecture: every prime occurs infinitely many times.

Examples

			Factorizations of for the first four terms of A024411 are given by
20 = 2 * 2 * 5; 28 = 2 * 2 * 7; 33 = 3 * 13; 36 = 2*2*3*3;
so that (a(1), a(2), a(3), a(4)) = (2, 2, 3, 2).
Corner of array whose n-th row shows the numbers n such that a(n) = n-th prime:
   1    2    4    6    7    9   11
   3    5    8   10   14   15   19
  12   18   23   30   43   47   56
  32   38   51   69   77   94  107
		

Crossrefs

Programs

  • Mathematica
    readOEISbFile[bNumber_] := ToExpression[ToString[Map[StringReplace[#,
     FromCharacterCode[32] -> FromCharacterCode[44]] &,
     Map[Most[#] &, Cases[Map[{#, StringFreeQ[StringTake[#, 1],
     Except[Apply[Alternatives, Flatten[{Map[ToString[#] &, Range[10] - 1],
     FromCharacterCode[45], FromCharacterCode[8722], "+"}]]]]} &,
     Map[StringDrop[StringDrop[#, 1], -1] &, DeleteCases[
     Map[ToString[{#}] &, Import[If[Head[bNumber] === Integer,
     "http://oeis.org/" <> "A" <> # <> "/b" <> # <> ".txt" &[
     StringTrim[StringReplace[ToString[PadLeft[IntegerDigits[bNumber], 6]],
     FromCharacterCode[{44, 32}] -> ""], "{" | "}"]],
     bNumber], "List"]], "{}"]]], {_, True}]]]]]
    s = readOEISbFile["http://oeis.org/A024411/b024411.txt"];
    (* s = 10000 terms of A024411 from b-file *)
    t = Map[Last, s]; u = Take[t, 1000];
    f[n_] := FactorInteger[n][[1, 1]]; Join[{1}, Array[f, 120, 2]]; v = Map[f, u]
    (* Peter J. C. Moses, Feb 03 2024 *)

A179271 Odd long legs `B` of more than one primitive Pythagorean triangle.

Original entry on oeis.org

2145, 3315, 3465, 4095, 4845, 5005, 5865, 6435, 6545, 6555, 7735, 8645, 9009, 9945, 10005, 10695, 11305, 11781, 13167, 13485, 13685, 13923, 14535, 15015, 15295, 15561, 16065, 16095, 17017, 17205, 17255, 17835, 17955, 18837, 19019, 19065
Offset: 1

Views

Author

Keywords

Comments

2145,752,2273;2145,1568,2657;;3315,812,3413;3315,2852,4373;

Crossrefs

Programs

  • Mathematica
    lst1={};lst={0};Do[Do[If[GCD[a,b]==1,c=Sqrt[a^2+b^2];If[IntegerQ[c],AppendTo[lst,b];L=Length[lst];If[lst[[L]]==lst[[L-1]]&&OddQ[lst[[L]]],Print[lst[[L]]];AppendTo[lst1,lst[[L]]]]]],{a,b-1,3,-1}],{b,4,4*7!}];lst1

Extensions

a(20) - a(36) Robert G. Wilson v, Jul 12 2010
Showing 1-2 of 2 results.