|
Search: id:A136433
|
|
|
| A136433 |
|
a(n+2)=a(n+1)*(n mod 3 + 1) + (n mod 2 + 1), a(1)=11. |
|
+0
1
|
|
| 11, 12, 26, 79, 81, 163, 491, 492, 986, 2959, 2961, 5923, 17771, 17772, 35546, 106639, 106641, 213283, 639851, 639852, 1279706, 3839119, 3839121, 7678243, 23034731, 23034732, 46069466, 138208399, 138208401, 276416803, 829250411, 829250412
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence goes multiply by 1, add 1, multiply by 2, add 2, multiply by 3, add 1, multiply by 1, add 2, multiply by 2, add 1, multiply by 3, add 2 and then the sequence repeats.
|
|
LINKS
|
Author?, Puzz.com's 1001 Best Puzzles: series 2
Brain Teaser of the Week, Grey matters, Jun 10 2001 - Jun 16 2001.
Rand Personnel, Quick Questions: Series 2
|
|
EXAMPLE
|
a(2)=12 because we can write 12 = 11 * 1 + 1.
a(3)=26 because we can write 26 = 12 * 2 + 2.
a(4)=79 because we can write 79 = 26 * 3 + 1.
a(5)=81 because we can write 81 = 79 * 1 + 2.
a(6)=163 because we can write 163 = 81 * 2 + 1.
a(7)=491 because we can write 491 = 163 * 3 + 2.
a(8)=492 because we can write 492 = 491 * 1 + 1.
a(9)=986 because we can write 986 = 492 * 2 + 2.
...
|
|
PROGRAM
|
(PARI) a=11; for(n=0, 50, print1(a", "); a=a*(n%3+1)+n%2+1)
|
|
CROSSREFS
|
Sequence in context: A041242 A042019 A022316 this_sequence A061760 A075559 A080138
Adjacent sequences: A136430 A136431 A136432 this_sequence A136434 A136435 A136436
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 01 2008
|
|
|
Search completed in 0.002 seconds
|
