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 A372900 #8 May 17 2024 01:44:52
%S A372900 1,6,12,52,390,650,663,2077,11479,31671,41158,43508,104894,123682,
%T A372900 127370,170819,175075,191516,266247,274378,327159,341638,366903,
%U A372900 383847,733985,1236087,1755063,1763775,2277964,2364654,3165126,6726156,7007823,7221084,10903815
%N A372900 Numbers k that divide the k-th term of Narayana's cows sequence.
%C A372900 Numbers k such that k | A000930(k).
%H A372900 Amiram Eldar, <a href="/A372900/b372900.txt">Table of n, a(n) for n = 1..43</a>
%e A372900 6 is a term since A000930(6) = 6 is divisible by 6.
%e A372900 12 is a term since A000930(12) = 60 = 5 * 12 is divisible by 12.
%t A372900 With[{m = 50000}, Position[LinearRecurrence[{1, 0, 1}, {1, 1, 2}, m]/Range[m], _?IntegerQ] // Flatten]
%o A372900 (PARI) lista(kmax) = {my(nc1 = 1, nc2 = 1, nc3 = 2, nc4); print1("1, "); for(k = 4, kmax, nc4 = nc1 + nc3; if(!(nc4 % k), print1(k, ", ")); nc1 = nc2; nc2 = nc3; nc3 = nc4);}
%Y A372900 Cf. A000930.
%Y A372900 Similar sequences: A014847 (Catalan), A016089 (Lucas), A023172 (Fibonacci), A051177 (partition), A232570 (tribonacci), A246692 (Pell), A266969 (Motzkin).
%K A372900 nonn
%O A372900 1,2
%A A372900 _Amiram Eldar_, May 16 2024