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.
%I A259752 #47 Apr 04 2025 10:35:55
%S A259752 6,30,54,78,102,126,150,174,198,222,246,270,294,318,342,366,390,414,
%T A259752 438,462,486,510,534,558,582,606,630,654,678,702,726,750,774,798,822,
%U A259752 846,870,894,918,942,966,990,1014,1038,1062,1086,1110,1134,1158,1182,1206
%N A259752 a(n) = 24*n - 18.
%C A259752 Original name: Numbers n such that n/A259748(n) = 6.
%C A259752 Partial sums give A152746. - _Leo Tavares_, Jul 29 2023
%H A259752 Danny Rorabaugh, <a href="/A259752/b259752.txt">Table of n, a(n) for n = 1..10000</a>
%H A259752 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A259752 A259748(a(n))/a(n) = 1/6.
%F A259752 a(n) = 6*A016813(n-1). - _Michel Marcus_, Jul 18 2015
%F A259752 G.f.: 6*x*(3*x+1)/(x-1)^2. - _Alois P. Heinz_, Jul 29 2023
%F A259752 From _Elmo R. Oliveira_, Apr 04 2025: (Start)
%F A259752 E.g.f.: 6*(exp(x)*(4*x - 3) + 3).
%F A259752 a(n) = 2*a(n-1) - a(n-2) for n > 2. (End)
%t A259752 A[n_] := A[n] = Sum[a b, {a, 1, n}, {b, a + 1, n}] ; Select[Range[600], Mod[A[#], #]/# == 1/6 & ]
%Y A259752 Cf. A000914, A016813, A063128, A063148, A152746.
%Y A259752 Other sequences of numbers n such that A259748(n)/n equals a constant: A008606, A073762, A259749, A259750, A259751, A259754, A259755.
%K A259752 nonn,easy
%O A259752 1,1
%A A259752 _José María Grau Ribas_, Jul 12 2015
%E A259752 Better name from _Danny Rorabaugh_, Oct 22 2015