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.

A379410 a(n) = n + floor(n*r/t) + floor(n*s/t), where r = u^(1/4), s = u^(1/2), t = u^(3/4), u = golden ratio (A001622).

This page as a plain text file.
%I A379410 #14 Jan 28 2025 10:41:35
%S A379410 1,4,7,10,12,15,18,21,23,25,28,31,34,37,39,42,45,47,49,52,55,58,61,63,
%T A379410 66,69,71,74,76,79,82,85,87,90,93,95,98,100,103,106,109,112,114,117,
%U A379410 119,122,124,127,130,133,136,138,140,143,146,149,151,154,157,160,162,164,167,170
%N A379410 a(n) = n + floor(n*r/t) + floor(n*s/t), where r = u^(1/4), s = u^(1/2), t = u^(3/4), u = golden ratio (A001622).
%C A379410 This sequence, A379408, and A379409 partition the positive integers.
%F A379410 a(n) = n + floor(n/r^2) + floor(n/r), where r = u^(1/4), u = golden ratio.
%t A379410 u = (1 + 5^(1/2))/2;
%t A379410 r = u^(1/4); s = u^(1/2); t = u^(3/4);
%t A379410 Table[n + Floor[n*s/r] + Floor[n*t/r], {n, 1, 120}]  (* A379408 *)
%t A379410 Table[n + Floor[n*r/s] + Floor[n*t/s], {n, 1, 120}]  (* A379409 *)
%t A379410 Table[n + Floor[n*r/t] + Floor[n*s/t], {n, 1, 120}]  (* A379410 *)
%Y A379410 Cf. A001622, A184908, A379408, A379409.
%K A379410 nonn
%O A379410 1,2
%A A379410 _Clark Kimberling_, Jan 21 2025
%E A379410 Values corrected by _R. J. Mathar_, Jan 28 2025