Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069829
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069829 a(n) = PS(n)(2n), where PS is described in A057032. +0
2
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; listen)
OFFSET

1,1

COMMENT

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 this_sequence A022429 A020907 A067568

Adjacent sequences: A069826 A069827 A069828 this_sequence A069830 A069831 A069832

KEYWORD

easy,nonn

AUTHOR

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

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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research