Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086790
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086790 a(n)=floor{(1*n^0+1*n^1+2*n^2+4*n^3)%(1*n^0+2*n^1+1*n^2)} +0
6
1, 2, 4, 8, 11, 15, 19, 23, 26, 30, 34, 38, 42, 46, 50, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 114, 118, 122, 126, 130, 134, 138, 142, 146, 150, 154, 158, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 202, 206, 210, 214, 218, 222, 226, 230 (list; graph; listen)
OFFSET

1,2

FORMULA

For n>=8 a(n)=4n-6 - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 06 2003

EXAMPLE

a(2)=floor{(1*2^0+1*2^1+2*2^2+4*2^3)/(1*2^0+2*2^1+1*2^2)}=floor(43/9)=floor(4.77778)=4

CROSSREFS

Adjacent sequences: A086787 A086788 A086789 this_sequence A086791 A086792 A086793

Sequence in context: A056689 A034037 A033153 this_sequence A115797 A003596 A018600

KEYWORD

easy,nonn

AUTHOR

Wang Dan (wangdan01(AT)lycos.com), Aug 04 2003

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 06 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research