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.

A184873 a(n) = n + floor(nr/t) + floor(ns/t), where r=log(2), s=log(3), t=log(5).

This page as a plain text file.
%I A184873 #11 Jun 30 2025 21:07:41
%S A184873 1,3,6,7,10,12,14,16,18,20,22,25,26,29,31,32,35,37,39,41,44,46,47,50,
%T A184873 52,54,56,59,60,62,65,66,69,71,73,75,77,79,81,84,85,88,90,92,94,96,99,
%U A184873 100,103,105,106,109,111,113,115,118,119,121,124,125,128,130,133,134,136,139,140,143,145,147,149,152,153,155,158,159,162,164,166,168,170,172,174,177,179,181,183,185,187,189,192,193,196,198,199,202,204,206,208,211,212,214,217,218,221,223,226,227,229,232,233,236,238,240,242,244,246,248,251,252
%N A184873 a(n) = n + floor(nr/t) + floor(ns/t), where r=log(2), s=log(3), t=log(5).
%C A184873 See A184812.
%t A184873 r=Log[2]; s=Log[3]; t=Log[5];
%t A184873 a[n_]:=n+Floor [n*s/r]+Floor[n*t/r];
%t A184873 b[n_]:=n+Floor [n*r/s]+Floor[n*t/s];
%t A184873 c[n_]:=n+Floor[n*r/t]+Floor[n*s/t];
%t A184873 Table[a[n], {n, 1, 120}]  (* A184871 *)
%t A184873 Table[b[n], {n, 1, 120}]  (* A184872 *)
%t A184873 Table[c[n], {n, 1, 120}]  (* A184873 *)
%Y A184873 Cf. A184871, A184872, A184876 (primes in A184873).
%K A184873 nonn
%O A184873 1,2
%A A184873 _Clark Kimberling_, Jan 23 2011
%E A184873 Name corrected by _Harvey P. Dale_, Jan 26 2011