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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117704 Least refined sequence that can be grouped to sum to either natural numbers or odd numbers. 2
1, 2, 1, 2, 3, 1, 5, 1, 5, 4, 3, 8, 9, 4, 6, 9, 2, 12, 3, 10, 9, 5, 15, 1, 15, 8, 9, 16, 2, 19, 6, 14, 15, 6, 22, 3, 20, 13, 11, 24, 1, 26, 10, 17, 22, 6, 29, 6, 24, 19, 12, 32, 1, 32, 15, 19, 30, 5, 36, 10, 27, 26, 12, 39, 4, 36, 21, 20, 39, 3, 43, 15, 29, 34, 11, 46, 8, 39, 28, 20, 49, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In other words, least common refinement of the natural numbers and the odd numbers.

LINKS

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

FORMULA

a(n) = A005214(n) - A005214(n-1).

EXAMPLE

As natural numbers: 1,2,1+2,3+1,5,1+5,4+3,8,...

As odd numbers: 1,2+1,2+3,1+5+1,5+4,3+8,...

PROG

(Haskell)

a117704 n = a117704_list !! (n-1)

a117704_list = 1 : zipWith (-) (tail a005214_list) a005214_list

-- Reinhard Zumkeller, Aug 03 2011

CROSSREFS

Cf. A118382, A005214, A000027, A005408.

Sequence in context: A210790 A224653 A101391 * A078032 A162453 A008313

Adjacent sequences:  A117701 A117702 A117703 * A117705 A117706 A117707

KEYWORD

nonn,easy

AUTHOR

Franklin T. Adams-Watters, Apr 27 2006

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 23 03:36 EST 2014. Contains 249837 sequences.