### Properties of the number 3742:

3742 = 2 × 1871 is semiprime and squarefree.3742 has 2 distinct prime factors, 4 divisors, 9 antidivisors and 1870 totatives.

Reversing the decimal digits of 3742 results in a prime.

3742 is the sum of 2 positive triangular numbers.

3742 is the difference of 2 positive pentagonal numbers in 2 ways.

3742 = 14

^{2}+ 39

^{2}+ 45

^{2}is the sum of 3 positive squares.

3742

^{2}is the sum of 3 positive squares.

3742 is a divisor of 191

^{5}- 1.

3742 is an emirpimes in (at least) the following bases: 2, 4, 5, 7, 8, 12, 13, 17, 18, 20, 21, 32, 34, 37, 41, 43, 44, 46, 47, 49, 50, 54, 60, 65, 71, 72, 73, 74, 76, 80, 82, 83, 85, 86, 89, 91, 94, 95, 99, and 100.

3742 is palindromic in (at least) the following bases: 16, -44, -55, and -87.

3742 in base 16 = e9e and consists of only the digits '9' and 'e'.

3742 in base 30 = 44m and consists of only the digits '4' and 'm'.

3742 in base 43 = 211 and consists of only the digits '1' and '2'.

### The number 3742 belongs to the following On-Line Encyclopedia of Integer Sequences (OEIS) sequences (among others):

Sequence numbers and descriptions below are taken from OEIS.A002703: Sets with a congruence property.

A079222: Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the six-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).

A080855: (9*n^2-3*n+2)/2.

A084849: a(n) = 1 + n + 2*n^2.

A125264: Numbers n such that n^10 + 9 is prime.

A185264: Number of disconnected 6-regular simple graphs on n vertices with girth at least 4.

A189912: Extended Motzkin numbers, Sum{k>=0} C(n,k)C(k), C(k) the extended Catalan number A057977(k).

A214203: Number of rooted planar binary unlabeled trees with n leaves and caterpillar index <= 5.

A243366: Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUDU (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, k<=0<=max(0,floor(n/2)-1), read by rows.

A249508: Lengths of complete iterations (direct and reverse branches) of the Oldenburger-Kolakoski sequence A000002.

## No comments:

## Post a Comment