Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092038
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092038 a(n+1) = a(n) + (a(n) mod 2)^(n mod a(n)), a(1) = 1. +0
2
1, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 13, 14, 14, 14, 15, 16, 16, 16, 17, 18, 18, 18, 19, 20, 20, 20, 21, 22, 22, 22, 23, 24, 24, 24, 25, 26, 26, 26, 27, 28, 28, 28, 29, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 35, 36, 36, 36, 37, 38, 38 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = floor(n/4) + floor((n-1)/4) + 2 for n>1.

CROSSREFS

Cf. A004524.

Sequence in context: A135304 A112325 A029111 this_sequence A159481 A046699 A102548

Adjacent sequences: A092035 A092036 A092037 this_sequence A092039 A092040 A092041

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 27 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