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.

A354990 Ordinal transform of A344005, where A344005(n) is the smallest positive integer m such that n divides m*(m+1).

This page as a plain text file.
%I A354990 #10 Jun 17 2022 18:11:28
%S A354990 1,2,1,1,1,2,1,1,1,2,1,2,1,2,1,1,1,2,1,3,3,2,1,3,1,2,1,2,1,2,1,1,1,2,
%T A354990 1,4,1,2,3,2,1,4,1,2,1,2,1,3,1,2,1,4,1,2,3,3,3,2,1,4,1,2,1,1,1,3,1,3,
%U A354990 1,2,1,5,1,2,3,1,1,5,1,5,1,2,1,1,1,2,1,1,1,2,1,2,3,2,2,2,1,2,1,4,1,2,1,1,3
%N A354990 Ordinal transform of A344005, where A344005(n) is the smallest positive integer m such that n divides m*(m+1).
%C A354990 Number of values of k, 1 <= k <= n, with A344005(k) = A344005(n).
%H A354990 Antti Karttunen, <a href="/A354990/b354990.txt">Table of n, a(n) for n = 1..65537</a>
%F A354990 a(n) >= A354991(n).
%o A354990 (PARI)
%o A354990 up_to = 65537;
%o A354990 ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om,invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om,invec[i],(1+pt))); outvec; };
%o A354990 A344005(n) = for(m=1, oo, if((m*(m+1))%n==0, return(m))); \\ From A344005
%o A354990 v354990 = ordinal_transform(vector(up_to,n,A344005(n)));
%o A354990 A354990(n) = v354990[n];
%Y A354990 Cf. A344005, A354991.
%Y A354990 Cf. also A344770, A345934.
%K A354990 nonn
%O A354990 1,2
%A A354990 _Antti Karttunen_, Jun 17 2022