login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092038 a(n+1) = a(n) + (a(n) mod 2)^(n mod a(n)), a(1) = 1. 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; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

Join[{1}, Table[Floor[n/4]+Floor[(n-1)/4]+2, {n, 2, 80}]] (* Harvey P. Dale, Oct 03 2012 *)

PROG

(Haskell)

a092038 n = a092038_list !! (n-1)

a092038_list = 1 : zipWith (\u v -> v + (v `mod` 2) ^ (u `mod` v))

                           [2..] a092038_list

-- Reinhard Zumkeller, Oct 10 2012

CROSSREFS

Cf. A004524.

Sequence in context: A029111 A228944 A213718 * A269990 A324473 A159481

Adjacent sequences:  A092035 A092036 A092037 * A092039 A092040 A092041

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Mar 27 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)