# Thread:

1. ## Sequence...

Find anfor this sequence:

5, 6, 7, 5, 6, 7, 5, 6, 7, ...

2. Originally Posted by bearej50
Find anfor this sequence:

5, 6, 7, 5, 6, 7, 5, 6, 7, ...
you can use a piece-wise definition: $a_n = \left \{ \begin{matrix} 5 & \text{ if } n \equiv 1 \bmod 3 \\ 6 & \text{ if } n \equiv 2 \bmod 3 \\ 7 & \text{ if } n \equiv 0 \bmod 3 \end{matrix} \right.$

are you familiar with the notation $n \equiv m \bmod 3$? It means $n = m + 3k$ for some integer $k$

3. I am familiar with this notation but I was looking for a more generalized formula. For example, for the sequence: 5, 7, 5, 7, .... an = 6 - (-1)^(n+1)
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 4, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8760533332824707, "perplexity_flag": "head"}