Search results

...] a '''Carmichael number''' is a [[composite number|composite]] positive [[integer]] <math>n</math>, which satisfies the [[congruence]] <math>b^{n-1}\equiv 1\ [[Category:Integer sequences]] ...

...n-2) \cdot\, \cdots \, \cdot 3 \cdot 1</math>. When n is an positive even integer, <math>n!!</math> is defined as <math>n \cdot (n-2) \cdot\, \cdots \, \cdo [[Category:Integer sequences]] ...

...+2+3+6+9+18>36</math>. The series is in the Online Encyclopedia of Integer Sequences (Sloane) as [[oeis:A005101|A005101]]. 120 is considered a super abundant nu [[Category:Integer sequences]] ...

[[Category:Integer sequences]] ...

...loane's A002407 : Cuban primes|website=The On-Line Encyclopedia of Integer Sequences|publisher=OEIS Foundation|access-date=2016-06-14}}</ref> It is also a [[sup ...ne's A076980 : Leyland numbers|website=The On-Line Encyclopedia of Integer Sequences|publisher=OEIS Foundation|access-date=2016-06-14}}</ref> ...

...4.<ref>{{cite journal|last=Trigg|first=Charles W.|year=1974|title=Infinite sequences of palindromic triangular numbers|url=https://www.mathstat.dal.ca/FQ/Scanne "A number {{nowrap|''n'' > 0}} is called "Brazilian" if there exists an integer ''b'' such that {{nowrap|1 < ''b'' < ''n'' – 1}} for which the representat ...

...the name of the [[Z-transform]]). The familiar [[decimal notation]] for [[integer]]s can also be viewed as an example of a power series, but with the argumen [[Category:Sequences and series]] ...

...the string as the [[base (mathematics)|base]] ''N''+1 representation of an integer. ...e integers, which allowed Gödel to encode not just strings of symbols, but sequences of strings as well. Given a sequence <math>x_1 x_2 x_3 ... x_n</math> of po ...

where ''n'' is a nonnegative [[integer]]. The first nine Fermat numbers are {{OEIS|id=A000215}}: .../web/20010716212746/http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A000215 |date=2001-07-16 }} ...

In this equation, ''m'' is every [[integer]] [[less than]] ''n''. ''σ'' is the [[sum]] of every [[Positive number|posi ...ation says that a superabundant number has to be an [[Even number|even]] [[integer]]. It also is a [[multiple]] of the ''k''-th primorial <math>p_k\#.</math> ...

...done repeatedly (over and over) starting at some [[Natural number|positive integer]] ''n'':<ref name="mactutor" /><ref>{{cite journal | url=https://www.jstor. ...33479|access-date=January 27, 2025|website=On-line Encyclopedia of Integer Sequences}}</ref> ...

In this equation, ''m'' is every [[integer]] less than ''n''. ''σ'' is the [[sum]] of every [[Positive number|positive [[Category:Integer sequences]] ...

Factorials are not defined for [[negative number|negative]] [[integer]]s. However, the related [[gamma function]] (<math>\Gamma(x)</math>) is def [[Category:Integer sequences]] ...

...e [[Riemann hypothesis]] is true then ''n''&nbsp;=&nbsp;5040 is the last [[integer]] that doesn't work in this equation. This [[inequality]] is also known as [[Category:Integer sequences]] ...

==Similar sequences== [[Category:Integer sequences]] ...

...er''', sometimes also called a '''perfect square''', is the result of an [[integer]] [[Operation (mathematics)#Multiplication|multiplied]] by itself. 1, 4, 9, ...is that its [[square]] [[Operation (mathematics)#Roots|root]] is again an integer. For example, <math>\sqrt9=3</math>, so 9 is a square number. ...

...number|sociable]]. A positive [[integer]] such that every smaller positive integer is a sum of distinct divisors of it is a [[practical number]]. ...gi?Anum=A000396 |date=2001-07-15 }} at the On-Line Encyclopedia of Integer Sequences ...

[[Category:Integer sequences]] ...

*'''OEIS''': Link to On-Line Encyclopedia of Integer Sequences (OEIS), where the constants are available with more details. *'''Continued fraction''': In the simple form [to integer; frac1, frac2, frac3, ...] (in brackets if periodic) ...

Harmonic sequences have been used by [[architect]]s. In the [[Baroque]] period architects used for every [[Positive number|positive]] [[integer]] <math>k</math>. ...