125460

Appears in sequences

• Vampire numbers (definition 2): numbers n with an even number of digits which have a factorization n = i*j where i and j have the same number of digits and the multiset of the digits of n coincides with the multiset of the digits of i and j.at n=23A014575
• Subset of vampire numbers A014575 having exactly two representations of the desired form.at n=0A048936
• a(n) is the number of subsequences {s(k)} of {1,2,3,...n} such that s(k+1)-s(k) is 1 or 3.at n=26A050228
• Let v = (1,4,9,...,n^2), x = (0,1,2,4,6,...) [first n terms of A002620]; a(n) = v.v * x.x - (v.x)^2.at n=16A060452
• Consider the line segment in R^n from the origin to the point v = (1,4,9,...,n^2); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.at n=15A060454
• Numbers k that, when expressed in base 4 and then interpreted in base 9, give a multiple of k.at n=30A062925
• Least vampire number with n fang pairs.at n=1A094208
• Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=33A144563
• Vampire numbers permutations of whose digits are other vampire numbers.at n=10A167266
• Number of permutations of [n] with no fixed points where the maximal displacement of an element equals three.at n=11A321049