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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069829 a(n) = PS(n)(2n), where PS is described in A057032. 1
2, 5, 9, 11, 13, 19, 17, 23, 31, 26, 25, 40, 29, 47, 58, 51, 37, 69, 41, 56, 71, 67, 49, 82, 70, 73, 92, 95, 61, 123, 65, 105, 118, 94, 112, 148, 77, 107, 134, 116, 85, 143, 89, 122, 177, 127, 97, 166, 130, 133, 175, 162, 109, 211, 159, 188, 190, 154, 121, 248, 125 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(n) = PS(n + c)(2n + c) for any positive integer c. Every positive integer occurs exactly once in either this sequence or in A057032.

CROSSREFS

Cf. A057032.

Sequence in context: A005123 A154732 A080154 * A022429 A020907 A206904

Adjacent sequences:  A069826 A069827 A069828 * A069830 A069831 A069832

KEYWORD

easy,nonn

AUTHOR

David Wasserman (wasserma(AT)spawar.navy.mil), Apr 22 2002

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

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

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.