|
Search: id:A005244
|
|
|
| A005244 |
|
A self-generating sequence: start with 2, take all products of any 2 previous elements, subtract 1 and adjoin them to the sequence.
(Formerly M0704)
|
|
+0
5
|
|
| 2, 3, 5, 9, 14, 17, 26, 27, 33, 41, 44, 50, 51, 53, 65, 69, 77, 80, 81, 84, 87, 98, 99, 101, 105, 122, 125, 129, 131, 134, 137, 149, 152, 153, 158, 159, 161, 164, 167, 173, 194, 195, 197, 201, 204, 206, 209, 219, 230, 233, 237, 239, 242, 243, 249
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n)=A139127(n)*a(k)-1 for some k; A139128 gives number of distinct representations a(n)=a(i)*a(j)-1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2008
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, E31.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..500
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
17 is present because it equals 2*9-1.
|
|
CROSSREFS
|
Sequence in context: A018138 A057225 A070819 this_sequence A058541 A023672 A023567
Adjacent sequences: A005241 A005242 A005243 this_sequence A005245 A005246 A005247
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
D. R. Hofstadter
|
|
EXTENSIONS
|
More terms from Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
