Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019461
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019461 Add 1, multiply by 1, add 2, multiply by 2, etc. +0
6
0, 1, 1, 3, 6, 9, 27, 31, 124, 129, 645, 651, 3906, 3913, 27391, 27399, 219192, 219201, 1972809, 1972819, 19728190, 19728201, 217010211, 217010223, 2604122676, 2604122689, 33853594957, 33853594971 (list; graph; listen)
OFFSET

0,4

LINKS

Nick Hobson, Python program for this sequence

MAPLE

A019461 := proc(n) option remember; if n = 0 then 0 elif n mod 2 = 1 then (n+1)/2+A019461(n-1) else (n/2)*A019461(n-1); fi; end;

CROSSREFS

Cf. A019463, A019460, A019462, A082448.

Adjacent sequences: A019458 A019459 A019460 this_sequence A019462 A019463 A019464

Sequence in context: A050889 A026095 A061929 this_sequence A067862 A062927 A045638

KEYWORD

nonn

AUTHOR

njas

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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research