|
Search: id:A113722
|
|
|
| A113722 |
|
A variant of Golomb's sequence using odd numbers: a(n) is the number of times 2*n+1 occurs, starting with a(1) = 1. |
|
+0
4
|
|
| 1, 3, 5, 5, 5, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25, 25, 25, 25, 27
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) is taken to be the smallest number >= a(n-1) which is compatible with the description.
|
|
EXAMPLE
|
Start with 1 in row 1 and form a triangle where row n is
generated from row n-1 by the rule given in the description.
Then row 2 will have (1) 3, row 3 will have (3) 5's,
row 4 will have (5) 7's, (5) 9's, and (5) 11's, etc.
The triangle begins:
1;
3;
5,5,5;
7,7,7,7,7,9,9,9,9,9,11,11,11,11,11; ...
The number of terms in each row (also row sums with offset)
is given by A113723:
[1,1,3,15,135,3845,769605,3821696361,...].
|
|
PROGRAM
|
(PARI) a=[1, 3, 5, 5, 5]; for(n=3, 20, for(i=1, a[n], a=concat(a, 2*n+1))); a
|
|
CROSSREFS
|
Cf. A001462 (Golomb's sequence), A113723, A113724, A113676.
Sequence in context: A119280 A016658 A131506 this_sequence A065688 A023828 A120133
Adjacent sequences: A113719 A113720 A113721 this_sequence A113723 A113724 A113725
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Floor van Lamoen (fvlamoen(AT)hotmail.com) and Paul D. Hanna (pauldhanna(AT)juno.com), Nov 08 2005
|
|
|
Search completed in 0.002 seconds
|
