|
%I #6 Jul 13 2013 12:04:34
%S 1,3,5,6,7,8,11,9,15,10,19,11,23,29,12,27,16,13,37,20,17,14,24,21,18,
%T 28,15,22,19,29,26,16,36,33,20,27,37,17,31,44,21,38,35,25,32,18,29,22,
%U 36,46,26,56,40,19,30,23,44,34,27,51,64,31,58,20,97,24
%N Smallest m such that n is contained in m-th row of A026835.
%C A026835(a(n),k) = n for some k.
%H Reinhard Zumkeller, <a href="/A219922/b219922.txt">Table of n, a(n) for n = 1..180</a>
%o (Haskell)
%o import Data.List (findIndex)
%o import Data.Maybe (fromJust)
%o a219922 n = (fromJust $ findIndex (n `elem`) a026835_tabl) + 1
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Dec 01 2012
|
