Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079318
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079318 a(0) = 1; for n > 0, a(n) = (3^(A000120(n)-1) + 1)/2. +0
3
1, 1, 1, 2, 1, 2, 2, 5, 1, 2, 2, 5, 2, 5, 5, 14, 1, 2, 2, 5, 2, 5, 5, 14, 2, 5, 5, 14, 5, 14, 14, 41, 1, 2, 2, 5, 2, 5, 5, 14, 2, 5, 5, 14, 5, 14, 14, 41, 2, 5, 5, 14, 5, 14, 14, 41, 5, 14, 14, 41, 14, 41, 41, 122, 1, 2, 2, 5, 2, 5, 5, 14, 2, 5, 5, 14, 5, 14, 14, 41, 2, 5, 5, 14, 5, 14, 14, 41, 5, 14, 14 (list; graph; listen)
OFFSET

0,4

COMMENT

For n>=1, a(n) mod 2 = A010060(n), the Thue-Morse sequence - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 23 2004

REFERENCES

D. Singmaster, On the cellular automaton of Ulam and Warburton, unpublished manuscript, 2003.

FORMULA

a(n)=sum(i+j+k=n, {n!/(i!*j!*k!)} mod 2 ) and 0<=k<=j<=i<=n. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 02 2004

EXAMPLE

Contribution from Omar E. Pol (info(AT)polprimos.com), Jul 18 2009: (Start)

If written as a triangle:

1;

1;

1,2;

1,2,2,5;

1,2,2,5,2,5,5,14;

1,2,2,5,2,5,5,14,2,5,5,14,5,14,14,41;

1,2,2,5,2,5,5,14,2,5,5,14,5,14,14,41,2,5,5,14,5,14,14,41,5,14,14,41,14,41,41,122;

(End)

CROSSREFS

Cf. A079314-A079319.

Cf. A092255.

Sequence in context: A117193 A026832 A089408 this_sequence A050315 A128978 A145862

Adjacent sequences: A079315 A079316 A079317 this_sequence A079319 A079320 A079321

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 12 2003

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research