Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005468 a(n)=1+a(floor(n/2))*a(ceiling(n/2)).
(Formerly M0649)
+0
2
1, 2, 3, 5, 7, 10, 16, 26, 36, 50, 71, 101, 161, 257, 417, 677, 937, 1297, 1801, 2501, 3551, 5042, 7172, 10202, 16262, 25922, 41378, 66050, 107170, 173890, 282310, 458330, 634350, 877970, 1215290, 1682210, 2335898, 3243602, 4504302, 6255002 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

PROGRAM

(PARI) v=vector(60); v[1]=1; for(k=2, 60, v[k]=v[k\2]*v[(k+1)\2]+1); v [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 22 2009]

CROSSREFS

Sequence in context: A134792 A033068 A052011 this_sequence A104622 A033843 A075657

Adjacent sequences: A005465 A005466 A005467 this_sequence A005469 A005470 A005471

KEYWORD

nonn,easy

AUTHOR

C. L. Mallows (colinm(AT)research.avayalabs.com)

EXTENSIONS

More terms from Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 22 2009

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