|
Search: id:A005041
|
|
|
| A005041 |
|
A self-generating sequence.
(Formerly M0258)
|
|
+0
1
|
|
| 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Problem 1047, Math. Mag., 52 (1979), 265.
|
|
FORMULA
|
For any k in {0, 1, 2, ...} and r in {0, 1, 2), we have: if n=6*k+(3/2)*(k)*(k-1)+r*(k+2), then a(n)=3*k+r+1. E.g. for k=3 and r=1, we have n=6*3+(3/2)*(3)*(3-1)+1*(3+2)=32 and so a(32)=3*3+1+1=11. - Francois Jooste (phukraut(AT)hotmail.com), Mar 12 2002
|
|
CROSSREFS
|
Cf. A005038 A005039 A005040 A005043 A005044 A055086 A001462 A082462 A024417 A084500.
Adjacent sequences: A005038 A005039 A005040 this_sequence A005042 A005043 A005044
Sequence in context: A055086 A001462 A082462 this_sequence A030530 A084500 A084557
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jeffrey Shallit
|
|
EXTENSIONS
|
More terms from Samuel Hilliard (sam_spade1977(AT)hotmail.com), Apr 11 2004
|
|
|
Search completed in 0.002 seconds
|
