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.

A334373 Starts of runs of 5 consecutive Moran numbers (A001101).

Original entry on oeis.org

25502420, 5301223225, 13242121221, 32005512020, 74761736450, 213415171233, 221221400424, 232212103220, 243857053493, 685392911334, 732258727252, 889011113804, 905191111482, 1013460525033, 1080719141080, 1229198438214, 1461057000513, 1961972092132, 2157993351414
Offset: 1

Views

Author

Amiram Eldar, Apr 25 2020

Keywords

Examples

			25502420 is a term since 25502420, 25502421, 25502422, 25502423 and 25502424 are all Moran numbers.
		

Crossrefs

Subsequence of A001101, A085775, A330928, A334371 and A334372.
Cf. A235397.

Programs

  • Mathematica
    moranQ[n_] := PrimeQ[n / Plus @@ IntegerDigits[n]]; m = moranQ /@ Range[5]; seq = {}; Do[If[And @@ m, AppendTo[seq, k - 5]]; m = Join[Rest[m], {moranQ[k]}], {k, 6, 10^8}]; seq

Extensions

Terms a(6) and beyond from Giovanni Resta, Apr 27 2020

A338516 Starts of runs of 4 consecutive numbers that are divisible by the total binary weight of their divisors (A093653).

Original entry on oeis.org

1377595575, 4275143301, 13616091683, 13640596128, 15016388244, 15176619135, 21361749754, 23605084359, 24794290167, 28025464183, 29639590888, 30739547718, 33924433023, 35259630279, 38008366692, 38670247670, 38681191672, 40210059079, 40507412213, 49759198333, 52555068607
Offset: 1

Views

Author

Amiram Eldar, Oct 31 2020

Keywords

Comments

Can 5 consecutive numbers be divisible by the total binary weight of their divisors? If they exist, then they are larger than 10^11.

Examples

			1377595575 is a term since the 4 consecutive numbers from 1377595575 to 1377595578 are all terms of A093705.
		

Crossrefs

Subsequence of A338514 and A338515.
Similar sequences: A141769, A330933, A334372, A338454.

Programs

  • Mathematica
    divQ[n_] := Divisible[n, DivisorSum[n, DigitCount[#, 2, 1] &]]; div = divQ /@ Range[4]; Reap[Do[If[And @@ div, Sow[k - 4]]; div = Join[Rest[div], {divQ[k]}], {k, 5, 5*10^9}]][[2, 1]]
    SequencePosition[Table[If[Mod[n,Total[Flatten[IntegerDigits[#,2]&/@Divisors[n]]]]==0,1,0],{n,526*10^8}],{1,1,1,1}][[;;,1]] (* The program will take a long time to run. *) (* Harvey P. Dale, May 28 2023 *)
Showing 1-2 of 2 results.