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.

A072632 Solutions to A072631[n]=0.

Original entry on oeis.org

1, 3, 8, 21, 55, 149, 404, 1097, 2981, 8104, 22027, 59875, 162755, 442414, 1202605, 3269018
Offset: 1

Views

Author

Labos Elemer, Jun 28 2002

Keywords

Comments

Essentially the same as A001671.

Examples

			Compare with A072610 [related to A004648].
		

Crossrefs

Programs

  • Mathematica
    Do[s=Floor[Mod[Floor[n*Log[n]]//N, n]]; If[s==0, Print[n]], {n, 1, 10000000}]

A244340 Floor( n^2*log(n) ) mod n.

Original entry on oeis.org

0, 0, 0, 2, 0, 4, 4, 5, 6, 0, 4, 9, 4, 13, 9, 5, 2, 0, 17, 18, 19, 0, 2, 6, 11, 18, 26, 8, 18, 1, 14, 28, 12, 30, 15, 0, 22, 8, 34, 22, 10, 41, 31, 22, 13, 5, 44, 39, 34, 30, 26, 24, 22, 21, 22, 23, 25, 29, 33, 39, 46, 54, 1, 10, 21, 34, 47, 63, 10, 27, 46
Offset: 1

Views

Author

Vincenzo Librandi, Jun 30 2014

Keywords

Comments

n for which a(n) is 0: 1, 2, 3, 5, 10, 18, 22, 36, 88, 92, 176, 235, 844, 1481, 1713, 7098, 8140, 19848, ... [Bruno Berselli, Jun 30 2014]

Crossrefs

Programs

  • Magma
    [Floor(n^2*Log(n)) mod n: n in [1..100]];
  • Mathematica
    Table[Floor[Mod[n^2 Log[n], n]], {n, 100}]
Showing 1-2 of 2 results.