OFFSET
1,2
COMMENTS
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 844.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Primefan, The First 2500 Integers Factored (first of 5 pages).
FORMULA
EXAMPLE
40 = 2^3*5^1 has 2 distinct prime factors, hence, 2 positive exponents in its prime factorization (although the 1 is often left implicit). 2 is less than the maximal exponent in 40's prime factorization, which is 3. Therefore, 40 does not belong to the sequence. But 10 = 2^1*5^1 and 20 = 2^2*5^1 belong, since the maximal exponents in their prime factorizations are 1 and 2 respectively.
MAPLE
isA212167 := proc(n)
end proc:
for n from 1 to 1000 do
if isA212167(n) then
printf("%d, ", n) ;
end if;
end do: # R. J. Mathar, Jan 06 2021
MATHEMATICA
okQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Max[f] <= Length[f]]; Select[Range[1000], okQ] (* T. D. Noe, May 24 2012 *)
PROG
(Haskell)
import Data.List (findIndices)
a212167 n = a212167_list !! (n-1)
a212167_list = map (+ 1) $ findIndices (>= 0) a225230_list
-- Reinhard Zumkeller, May 03 2013
(PARI) is(k) = {my(e = factor(k)[, 2]); !(#e) || vecmax(e) <= #e; } \\ Amiram Eldar, Sep 09 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Matthew Vandermast, May 22 2012
STATUS
approved