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.

A043550 Least k for which the integers floor(3*k/m) for m=2,3,...,n are distinct.

This page as a plain text file.
%I A043550 #8 Apr 24 2021 21:47:54
%S A043550 1,1,2,2,3,7,9,10,14,19,24,27,30,37,44,52,61,70,75,86,97,102,114,127,
%T A043550 140,147,169,177,192,209,226,234,252,271,290,310,331,352,363,386,409,
%U A043550 432,444,469,494,520,547,574,602,631,660,675
%N A043550 Least k for which the integers floor(3*k/m) for m=2,3,...,n are distinct.
%K A043550 nonn
%O A043550 1,3
%A A043550 _Clark Kimberling_