This is very interesting puzzle. I found a hint online which will help you to solve =

1+2+3+4\ \Rightarrow\ One\ +\ Two\ +\ Three+\ Four

\Rightarrow O+T+T+F

\Rightarrow Alphabet\ 15\ +\ Alphabet\ 20+Alphabet\ 20\ +Alphabet\ 6

\Rightarrow15+20+20+6\ \Rightarrow\ 61

So, applying same logic,

7+8+9+10\ \Rightarrow\ Seven+Eight+Nine+Ten\ \Rightarrow\ S+E+N+T\ \Rightarrow\ Alphabet\ 19\ +\ Alphabet\ 5+\ Alphabet\ 14\ +\ Alphabet\ 20\ \Rightarrow\ 19+5+14+20\ \Rightarrow\ 58.

Ref: https://math.stackexchange.com/questions/1615278/maths-puzzle-logic

I found an answer from www.quora.com

**If 3** = 18, **4** = 32, **5** = **50**, **6** = 72, **7** = 98, **then 10**

**If 3** = 18, **4** = 32, **5** = **50**, **6** = 72, **7** = 98, **then 10** = anjydS aISjbGYybkq .... **If 2**→**5**=
47, **3**→**6**=99, **4**→**7**=200, **5**→**8**=379, **then** what does **7**→**10**=? 16,834 Views.

For more information, see **If 3** = 18, **4** = 32, **5** = **50**, **6** = 72, **7** = 98, **then 10**

I found an answer from mathworld.wolfram.com

Pythagorean Triple -- from Wolfram MathWorld

The right triangle having these side lengths is sometimes called the **3**, **4**, **5** ... **One**
side may have two **of** these divisors, as in (**8**, 15, 17), (**7**, 24, 25), and ... **2 2**; -**2** -**1** -
**2**; **2 2 3**. (**5**). A, =[ **1 2 2**; **2 1 2**; **2 2 3**]. (**6**). D, =[-**1** -**2** -**2**; **2 1 2**; **2 2 3**. (**7**) ... **of**
possible primitive triangles which may have a leg (other **than** the .... **52**, 305-318,
1995.

For more information, see Pythagorean Triple -- from Wolfram MathWorld

I found an answer from mathworld.wolfram.com

Square Number -- from Wolfram MathWorld

The result obtained by carrying out this operation is **then** the square **of** the
average **of** the initial two numbers, ... is the floor function, and the first few are **2**, **3**
, **5**, **6**, **7**, **8**, **10**, 11, . ... The following table gives the last digit **of** b^**2 for** b=0 , **1**, ..., **9**
(where numbers with .... **4**, **4**, A025360, **52**, 58, 63, 70, 76, 84, 87, 91, 93, 97, 98,
103, .

For more information, see Square Number -- from Wolfram MathWorld

I found an answer from stackoverflow.com

factor to numeric: data are totally different - Stack Overflow

[**1**] **1 2 3 4 5** as.numeric(as.character(a)) # returns the factor levels, as numeric # [
**1**] **10** 20 30 40 **50** b <- factor(c(**10**,20,30,40,**50**)) as.numeric(b) # returns the ...

For more information, see factor to numeric: data are totally different - Stack Overflow

I found an answer from www.quora.com

What comes next in the following sequence: **61**, **52**, 63, 94, and 46 ...

Answered May 8, 2017. The next numbers in sequence are 18,1,121. Given
numbers in the sequence are just reverse **of** the square **of 1**,**2**,**3**,**4**,**5**,**6**,**7**,**8**,**9**,**10**,11
i.e. ...

For more information, see What comes next in the following sequence: **61**, **52**, 63, 94, and 46 ...

I found an answer from en.wikipedia.org

Table **of** divisors - Wikipedia

The tables below list all **of** the divisors **of** the numbers **1** to 1000. A divisor **of** an
integer n is an ... **For** example, **3** is a divisor **of** 21, since 21/**7** = **3** (and **7** is also a
divisor **of** 21). **If** m is a divisor **of** n **then** so is −m. The tables below only ... 20, **1**, **2**,
**4**, **5**, **10**, 20, **6**, 42, 22, abundant, highly abundant, composite. n, Divisors, d(n), σ(
n) ...

For more information, see Table **of** divisors - Wikipedia

I found an answer from en.wikipedia.org

List **of** OEIS sequences - Wikipedia

This article provides a list **of** integer sequences in the On-Line Encyclopedia **of**
Integer ... **6**, **4**, **6**, **4**, …} φ(n) is the number **of** positive integers not greater **than** n
that are prime to n. A000027 · Natural numbers, {**1**, **2**, **3**, **4**, **5**, **6**, **7**, **8**, **9**, **10**, …} ....
A001065 · Sum **of** proper divisors s(n), {0, **1**, **1**, **3**, **1**, **6, 1**, 7, **4**, 8, …} s(n) = σ(n) − n
...

For more information, see List **of** OEIS sequences - Wikipedia