|
| |
| |
|
|
|
3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Same as Pisot sequences E(3,4), P(3,4), T(3,4). See A008776 for definitions of Pisot sequences.
Non-Fermat-exponents, positive integers n such that there are no solutions in positive integers of the equation a^n+b^n = c^n. [Tanya Khovanova, Jul 9 2011]
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = n+3.
O.g.f.: (3-2*x)/(1-x)^2. a(n)=A009005(n), n>1. - R. J. Mathar, May 26 2008
|
|
|
CROSSREFS
| Sequence in context: A184985 A114637 * A065475 A062983 A081311 A053233
Adjacent sequences: A009053 A009054 A009055 * A009057 A009058 A009059
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| David W. Wilson (davidwwilson(AT)comcast.net)
|
| |
|
|
