Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080456
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080456 a(1) = a(2) = 2; for n>2, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1)+4 otherwise. +0
2
2, 6, 10, 14, 18, 18, 22, 26, 30, 30, 34, 38, 42, 42, 46, 50, 54, 54, 58, 62, 66, 66, 70, 74, 78, 78, 82, 86, 90, 90, 94, 98, 102, 102, 106, 110, 114, 114, 118, 122, 126, 126, 130, 134, 138, 138, 142, 146, 150, 150, 154, 158, 162, 162, 166, 170, 174, 174 (list; graph; listen)
OFFSET

1,1

COMMENT

First differences are 4-periodic.

LINKS

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

FORMULA

a(n)=-2+4*((n+2) mod (n+1))+Sum_{k=0..n}{(1/2)*[(k mod 4)+((k+1) mod 4)-((k+2) mod 4)+3*((k+3) mod 4)]} - Paolo P. Lava (ppl(AT)spl.at), Aug 29 2007

CROSSREFS

Cf. A080455-A080458, A080036, A080037.

Sequence in context: A080324 A130319 A067368 this_sequence A068977 A111284 A130824

Adjacent sequences: A080453 A080454 A080455 this_sequence A080457 A080458 A080459

KEYWORD

nonn

AUTHOR

njas, Mar 20 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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research