Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097803
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097803 3(2*n^2 + 1). +0
2
3, 9, 27, 57, 99, 153, 219, 297, 387, 489, 603, 729, 867, 1017, 1179, 1353, 1539, 1737, 1947, 2169, 2403, 2649, 2907, 3177, 3459, 3753, 4059, 4377, 4707, 5049, 5403, 5769, 6147, 6537, 6939, 7353, 7779, 8217, 8667, 9129, 9603, 10089, 10587, 11097, 11619 (list; graph; listen)
OFFSET

0,1

COMMENT

a(n) is also the number of Arnoux-Rauzy factors of length (n+1) over a 3-letter alphabet. [From Genevieve Paquin (genevieve.paquin(AT)univ-savoie.fr), Nov 07 2008]

REFERENCES

F. Mignosi and L. Q. Zamboni, On the number of Arnoux-Rauzy words, Acta arith., 101 (2002), no. 2, 121-129 [From Genevieve Paquin (genevieve.paquin(AT)univ-savoie.fr), Nov 07 2008]

FORMULA

a(0)=3, a(n+1)=a(n)+75. - Robert G. Wilson v

MATHEMATICA

Table[ 3(2*n^2 + 1), {n, 0, 44}] (from Robert G. Wilson v Aug 26 2004)

Table[3(25n + 1), {n, 0, 44}] (from Robert G. Wilson v Aug 26 2004)

CROSSREFS

Cf. A097802.

Sequence in context: A093665 A093546 A015955 this_sequence A161712 A137368 A036215

Adjacent sequences: A097800 A097801 A097802 this_sequence A097804 A097805 A097806

KEYWORD

nonn

AUTHOR

George E. Antoniou (george.antoniou(AT)montclair.edu), Aug 25 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Mark Hudson (mrmarkhudson(AT)hotmail.com), Aug 26 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research