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 A377413 #7 Oct 28 2024 16:24:47 %S A377413 0,1,2,21,4,5,42,21,8,81,10,341,84,65,42,1365,16,17,162,1045,20,21, %T A377413 682,69,168,325,130,81,84,261,2730,341,32,1089,34,1365,324,4181,2090, %U A377413 273,40,1025,42,5461,1364,5445,138,20821,336,1029,650,4437,260,5141,162 %N A377413 a(n) is the least term of A126684 of the form k*n with k > 0. %H A377413 Rémy Sigrist, <a href="/A377413/b377413.txt">Table of n, a(n) for n = 0..10000</a> %H A377413 Rémy Sigrist, <a href="/A377413/a377413.txt">C++ program</a> %F A377413 a(n) = A377412(n)*n. %F A377413 a(n) >= A300889(n) for any n > 0. %F A377413 a(n) = n iff n belongs to A126684. %e A377413 The first terms, in decimal and in binary, are: %e A377413 n a(n) bin(a(n)) %e A377413 -- ---- --------- %e A377413 0 0 0 %e A377413 1 1 1 %e A377413 2 2 10 %e A377413 3 21 10101 %e A377413 4 4 100 %e A377413 5 5 101 %e A377413 6 42 101010 %e A377413 7 21 10101 %e A377413 8 8 1000 %e A377413 9 81 1010001 %e A377413 10 10 1010 %e A377413 11 341 101010101 %e A377413 12 84 1010100 %o A377413 (C++) // See Links section. %Y A377413 See A300889 for a similar sequence. %Y A377413 Cf. A126684, A377412. %K A377413 nonn,base,easy %O A377413 0,3 %A A377413 _Rémy Sigrist_, Oct 27 2024