login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008344 a(1)=0; thereafter a(n+1) = a(n) - n if a(n) >= n otherwise a(n+1) = a(n) + n. 11
0, 1, 3, 0, 4, 9, 3, 10, 2, 11, 1, 12, 0, 13, 27, 12, 28, 11, 29, 10, 30, 9, 31, 8, 32, 7, 33, 6, 34, 5, 35, 4, 36, 3, 37, 2, 38, 1, 39, 0, 40, 81, 39, 82, 38, 83, 37, 84, 36, 85, 35, 86, 34, 87, 33, 88, 32, 89, 31, 90, 30, 91, 29, 92, 28, 93, 27, 94, 26, 95, 25, 96, 24, 97, 23, 98 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

p^a(n) = A084110(p^(n-1)) for n>1 and p prime. - Reinhard Zumkeller, May 12 2003

For n > 1: a(A029858(n)) = A029858(n) and a(A003462(n)) = 0. - Reinhard Zumkeller, May 09 2012

Absolute first differences of A085059; abs(a(n+1)-a(n)) = n, see also A086283. - Reinhard Zumkeller, Oct 17 2014

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Index entries for sequences related to Recamán's sequence

FORMULA

This is a concatenation S_0, S_1, S_2, ... where S_i = [b_0, b_1, ..., b_{3^(i+1)-1}] with b_0 = 0, b_{2j-1} = k+1-j, b_{2j} = 2k+j (j=1..k), k=(3^(i+1)-1)/2. E.g. S_0 = [0, 1, 3], S_1 = [0, 4, 9, 3, 10, 2, 11, 1, 12].

With offset 1 (i.e. a(1) = 1) : a((3^n-1)/2) = 0; a((3^n-1)/2 + 2k-1) = (3^n-1)/2-k for 1< = k< = (3^n-1)/2; a((3^n-1)/2 + 2k) = 3^n+k for 1< = k<(3^n-1)/2. - Benoit Cloitre, Jan 09 2003

MAPLE

A008344 := proc(n) option remember; if n = 0 then 0 elif A008344(n-1) >= (n-1) then A008344(n-1)-(n-1) else A008344(n-1)+(n-1); fi; end;

MATHEMATICA

a[1]=0; a[n_] := a[n]=If[a[n-1]>=n-1, a[n-1]-n+1, a[n-1]+n-1]

Transpose[ NestList[ If[First[#]>=Last[#], {First[#]-Last[#], Last[#]+1}, {First[#]+Last[#], Last[#]+1}]&, {0, 1}, 80]][[1]] (* Harvey P. Dale, Jun 20 2011 *)

PROG

(Haskell)

a008344 n = a008344_list !! (n-1)

a008344_list = 0 : f 0 [1..] where

   f x (z:zs) = y : f y zs where y = if x < z then x + z else x - z

-- Reinhard Zumkeller, Oct 17 2014, May 08 2012

CROSSREFS

Cf. A046901, A008343.

Equals A085059(n)-1.

Cf. A088230.

Cf. A085059, A086283.

Sequence in context: A255504 A178593 A021332 * A088230 A181482 A072329

Adjacent sequences:  A008341 A008342 A008343 * A008345 A008346 A008347

KEYWORD

nonn,easy,nice,look

AUTHOR

N. J. A. Sloane

EXTENSIONS

Name edited by Dmitry Kamenetsky, Feb 14 2017

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 05:25 EST 2017. Contains 294853 sequences.