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.

A081382 a(1) = 1, for n > 1 a(n) = Min{x > n, A008472(x) = A008472(n)}.

This page as a plain text file.
%I A081382 #9 Jun 12 2015 09:04:45
%S A081382 1,4,9,8,6,12,10,16,27,20,121,18,22,28,45,32,210,24,34,40,30,44,273,
%T A081382 25,36,52,81,56,399,60,58,64,70,68,42,48,435,76,55,49,651,84,82,88,75,
%U A081382 92,777,54,50,80,91,104,903,72,66,98,85,116,1645,63,118,124,90,128,77,117
%N A081382 a(1) = 1, for n > 1 a(n) = Min{x > n, A008472(x) = A008472(n)}.
%C A081382 Differs from A065642, a(n) <= A065642(n).
%H A081382 Reinhard Zumkeller, <a href="/A081382/b081382.txt">Table of n, a(n) for n = 1..10000</a>
%t A081382 ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] spf[x_] := Apply[Plus, ba[x]] Table[Min[Flatten[Position[Table[spf[w], {w, n+1, n^2}]-spf[n], 0]]+n], {n, 1, 100}]
%o A081382 (Haskell)
%o A081382 a081382 1 = 1
%o A081382 a081382 n = head [x | let sopf = a008472 n, x <- [n+1..], a008472 x == sopf]
%o A081382 -- _Reinhard Zumkeller_, Jun 12 2015
%Y A081382 Cf. A065642, A008472.
%K A081382 nonn
%O A081382 1,2
%A A081382 _Labos Elemer_, Mar 26 2003